Advanced Search
MyIDEAS: Login to save this paper or follow this series

Efficiency and Equilibrium in Task Allocation Economics with Hierarchical Dependencies

Contents:

Author Info

  • William E. Walsh
  • Michael P. Wellman

Abstract

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.

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by Santa Fe Institute in its series Working Papers with number 99-07-049.

as in new window
Length:
Date of creation: Jul 1999
Date of revision:
Handle: RePEc:wop:safiwp:99-07-049

Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC

Related research

Keywords: Supply chain formation; competitive equilibrium; distributed systems;

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Cheng, John Q & Wellman, Michael P, 1998. "The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes," Computational Economics, Society for Computational Economics, vol. 12(1), pages 1-24, August.
  2. Satterthwaite, Mark A. & Williams, Steven R., 1989. "Bilateral trade with the sealed bid k-double auction: Existence and efficiency," Journal of Economic Theory, Elsevier, vol. 48(1), pages 107-133, June.
  3. Paul R. Milgrom, 1985. "Auction Theory," Cowles Foundation Discussion Papers 779, Cowles Foundation for Research in Economics, Yale University.
  4. Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
  5. Gul, F. & Stacchetti, E., 1997. "Walrasian Equilibrium Without Complementarities," Papers 97-03, Michigan - Center for Research on Economic & Social Theory.
  6. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
  7. McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
  8. R. Preston McAfee & John McMillan, 1996. "Analyzing the Airwaves Auction," Journal of Economic Perspectives, American Economic Association, vol. 10(1), pages 159-175, Winter.
  9. Peter R. Wurman & Michael P. Wellman, 1999. "Equilibrium Prices in Bundle Auctions," Working Papers 99-09-064, Santa Fe Institute.
  10. Michael H. Rothkopf & Aleksandar Peke\v{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
  11. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-07-049. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.