On auction protocols for decentralized scheduling
AbstractThis note shows that, for the combinatorial market goods defined by Wellman et al. (2001), there may not exist an optimal allocation that is in equilibrium. Moreover, this result holds even if the value of each processed job is independent of its completion time. The proposed algorithm for finding an equilibrium allocation, using an assignment model, fails due to complementarity, even for instances that admit an optimal allocation which is in equilibrium.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 72 (2011)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Capacity allocation and scheduling Noncooperative game Auction Equilibrium;
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.:
- Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.