A Cooperative Approach To Queue Allocation Of Indivisible Objects
We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining stable outcomes.
Volume (Year): 11 (2009)
Issue (Month): 02 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
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.:
- Tijs, S.H. & Parthasarathy, T. & Potters, J.A.M. & Rajendra Prasad, V., 1984. "Permutation games : Another class of totally balanced games," Other publications TiSEM a7edfa18-6224-4be3-b677-5, Tilburg University, School of Economics and Management.
- Quint, Thomas, 1996. "On One-Sided versus Two-Sided Matching Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 124-134, September.
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680, March.
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:11:y:2009:i:02:p:215-227. 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: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.