Download:
|
by Er Babanov, John Collins, Maria Gini
In Proc. of AAMAS’04
http://www.cs.umn.edu/magnet/papers/common/bab04aamas.ps.gz
Add To MetaCart
Abstract:
In previous work we proposed an approach for computing an agent's preferences over different schedules of tasks, and for soliciting desirable bid combinations to cover the tasks. The proposed approach finds schedules that maximize the agent's Expected Utility. The maximization problem is hard because the domain is piece-wise continuous, with the number of pieces and local maxima growing exponentially in the worst case scenario. For agents who are averse to taking risks, maximization algorithms tend to converge to degenerate maxima of no practical interest. In this paper we demonstrate three different maximization methods based on domain-specific heuristics. We also present a new stochastic maximization approach and benchmark it in two substantially different problem setups. 1.
Citations
|
772
|
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
– Smith
- 1980
|
|
579
|
Microeconomic Theory
– Mas-Colell, Whinston, et al.
- 1995
|
|
209
|
Modern Heuristic Techniques for Combinatorial Problems
– Reeves
- 1993
|
|
183
|
Auction Theory
– Krishna
- 2002
|
|
133
|
Sold!: Auction methods for multi-robot coordination
– Gerkey, Matarić
- 2002
|
|
115
|
Auction protocols for decentralized scheduling
– Walsh, Wellman, et al.
- 1998
|
|
80
|
A combinatorial auction for collaborative planning
– Hunsberger, Grosz
- 2000
|
|
73
|
Preference elicitation in combinatorial auctions
– Conen, Sandholm
- 2001
|
|
68
|
A market protocol for decentralized task allocation
– Walsh, Wellman
- 1998
|
|
54
|
Risk aversion in the small and in the large
– Pratt
- 1964
|
|
35
|
Combinatorial auctions for supply chain formation
– Walsh, Wellman, et al.
- 2000
|
|
28
|
Exploring bidding strategies for market-based scheduling. Decision Support Systems
– Reeves, Wellman, et al.
- 2003
|
|
26
|
MASCOT: an agent-based architecture for coordinated mixed-initiative supply chain planning and scheduling
– Sadeh, Hildum, et al.
- 1999
|
|
24
|
Concurrent auctions across the supply chain
– Babaioff, Nisan
- 2001
|
|
18
|
A multi-agent negotiation testbed for contracting tasks with temporal and precedence constraints
– Collins, Ketter, et al.
- 2002
|
|
14
|
Specifying rules for electronic auctions
– Wurman, Wellman, et al.
- 2002
|
|
11
|
Problem difficulty for tabu search in job-shop scheduling
– Watson, Beck, et al.
- 2003
|
|
5
|
Scheduling tasks with precedence constraints to solicit desirable bid combinations
– Babanov, Collins, et al.
- 2003
|
|
4
|
Generating bids for group-related actions in the context of prior commitments
– Hunsberger
- 2002
|
|
3
|
Asking the right question: Risk and expectation in multi-agent contracting
– Babanov, Collins, et al.
- 2003
|
|
3
|
Scheduling to be competitive in supply chains
– Dutta, Sen, et al.
- 2001
|
