Efficiency and Equilibrium in Task Allocation Economies with Hierarchical Dependencies

We analyze economic efficiency and equilibrium properties in decentralized task allocation problems involving hierarchical dependencies and resource contention. We bound the inefficiency of a type of approximate equilibrium in proportion to the number of agents and the bidding parameters in a particular market protocol. This protocol converges to an approximate equilibrium with respect to all agents, except those which may acquire unneeded inputs. We introduce a decommitment phase to allow such agents to decommit from their input contracts. Experiments indicate that the augmented market protocol produces highly efficient allocations on average.

[1]  Jstor,et al.  Invention in the Industrial Research Laboratory , 1963, Journal of Political Economy.

[2]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[3]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[4]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[5]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[6]  Editors , 1986, Brain Research Bulletin.

[7]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

[8]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[9]  Steven R. Williams,et al.  Bilateral trade with the sealed bid k-double auction: Existence and efficiency , 1989 .

[10]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

[11]  Michael P. Wellman A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[12]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[13]  Jeffrey S. Rosenschein and Gilad Zlotkin Rules of Encounter , 1994 .

[14]  R. McAfee,et al.  Analyzing the Airwaves Auction , 1996 .

[15]  Faruk Gul,et al.  Walrasian Equilibrium Without Complementarities , 1997 .

[16]  S. Bikhchandani,et al.  Competitive Equilibrium in an Exchange Economy with Indivisibilities , 1997 .

[17]  Michael P. Wellman,et al.  A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[18]  Martin Andersson,et al.  Leveled commitment contracting among myopic individually rational agents , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[19]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[20]  Michael P. Wellman,et al.  The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes , 1998 .

[21]  Michael P. Wellman,et al.  Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..

[22]  Michael P. Wellman,et al.  Some economics of market-based distributed scheduling , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[23]  Peter R. Wurman,et al.  Equilibrium Prices in Bundle Auctions , 1999 .

[24]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[25]  Tuomas Sandholm,et al.  Approaches to winner determination in combinatorial auctions , 2000, Decis. Support Syst..

[26]  Sherwood C. Frey,et al.  Auctions , 2009, SSRN Electronic Journal.