Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solutions, and the behavior of an ascending auction mechanism and bidding protocol. To remedy the potential nonexistence of price equilibria due to complementarities in preference, we introduce additional markets in combinations of basic goods. Finally, we consider direct revelation mechanisms, and compare to the market-based approach.
|
534
|
J.R.: Microeconomic Theory
– Mas-Colell, Whinston
- 1995
|
|
364
|
An algorithm for optimal winner determination in combinatorial auctions
– Sandholm
- 1999
|
|
353
|
Multipart Pricing of Public Goods
– Clarke
|
|
329
|
Lottery Scheduling: Flexible Proportional-Share Resource Management
– Waldspurger, Weihl
- 1994
|
|
287
|
Incentives in teams
– Groves
- 1973
|
|
262
|
A Market-Oriented Programming Environment and Its Application to Distributed Multicommodity Flow Problems
– Wellman
- 1993
|
|
230
|
Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
– Fujishima, Leyton-Brown, et al.
|
|
216
|
Auctions and Bidding
– Preston, John
- 1987
|
|
200
|
Spawn: A distributed computational economy
– Waldspurger, Hogg, et al.
- 1992
|
|
186
|
The Michigan Internet AuctionBot: A Configurable Auction Server for
– Wurman, Wellman, et al.
- 1998
|
|
170
|
Market-based control. A paradigm for distributed resource allocation
– Clearwater
- 1996
|
|
120
|
Efficient Mechanisms for Bilateral Trading
– Myerson, Satterthwaite
- 1983
|
|
114
|
A Combinatorial Auction Mechanism for Airport Time Slot Allocation
– Rassenti, Smith, et al.
- 1982
|
|
111
|
Mariposa: A Wide-Area Distributed Database System
– Stonebraker, Aoki, et al.
- 1996
|
|
106
|
Putting Auction Theory to Work: The Simultaneous Ascending Auction
– Milgrom
|
|
105
|
Analyzing the Airwaves Auction
– McAfee, McMillan
- 1996
|
|
100
|
Enterprise: A Market-like Task Scheduler for Distributed Computing Environments,’’ in The Ecology of Computation Ž
– Malone, Fikes, et al.
- 1988
|
|
99
|
ibundle: An Efficient Ascending Price Bundle Auction
– Parkes
- 1999
|
|
98
|
1957]. Assignment problems and the location of economic activities
– Koopmans, Beckmann
|
|
84
|
Market-oriented programming: Some early lessons
– Wellman
- 1996
|
|
79
|
Allocating Uncertain and Unresponsive Resources: An Experimental Approach
– Banks, Ledyard, et al.
- 1989
|
|
69
|
A New and Improved Design for Multi-object Iterative Auctions,’’ technical report
– DeMartini, Kwasnica, et al.
- 1998
|
|
68
|
Multi-item auctions
– Demange, Gale, et al.
- 1986
|
|
56
|
Generalized Vickrey Auctions
– Varian, MacKie-Mason
- 1994
|
|
53
|
Competitive Equilibrium in an Exchange Economy with Indivisibilities
– Bikhchandani, Mamer
- 1997
|
|
52
|
Elicitation of Honest Preferences for the Assignment of Individuals to Positions
– Leonard
|
|
48
|
A simple computational market for network information services
– Mullen, Wellman
- 1995
|
|
48
|
A computational market model for distributed configuration design
– Wellman
- 1994
|
|
40
|
The assignment game I: the core
– Shapley, Shubik
|
|
39
|
matchings, coalition formation, and gross substitute
– Job
- 1982
|
|
30
|
A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks
– Brewer, Plott
- 1996
|
|
29
|
Efficiency and equilibrium in task allocation economies with hierarchical dependencies
– Walsh, Wellman
- 1999
|
|
29
|
Market Structure and Multidimensional Auction Design for Computational Economies
– Wurman
- 1999
|
|
28
|
Metaphor or Reality: A Case Study where Agents Bid with Actual Costs to Schedule a Factory,’’ in Market-Based Control: A Paradigm for Distributed Resource Allocation Ž
– Baker
- 1995
|
|
28
|
Market-Based Negotiation for Digital Library Services
– Mullen, Wellman
- 1996
|
|
22
|
A trading agent competition for the research community
– Wellman, Wurman
- 1999
|
|
17
|
The Competitive Allocation Process is Informationally Efficient Uniquely
– Jordan
- 1982
|
|
17
|
Kurose and Rahul Simha. A microeconomic approach to optimal resource allocation in distributed computer systems
– James
- 1989
|
|
17
|
On Combinatorial Auction and Lagrangean Relaxation for Distributed Resource Scheduling
– Kutanoglu, Wu
- 1999
|
|
12
|
A parametrization of the auction design space. Games and Economic Behavior, this volume
– Wurman, Wellman, et al.
- 2000
|
|
10
|
Neapolitan and Kumarss Naimipour. Foundations of Algorithms Using C
– Richard
- 2004
|
|
9
|
A Market-Based Approach to Workflow Automation,’’ presented at the
– Harker, Ungar
- 1996
|
|
5
|
Competitive scenarios for heterogeneous trading agents
– guez-Aguilar, n, et al.
- 1998
|
|
3
|
Aleksander Peke c
– Rothkopf
- 1998
|
|
