The difference indifference makes in strategy-proof allocation of objects
We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study problems where each person initially owns an object and every object is owned. For such problems, when preferences are strict, the “top trading cycles” algorithm provides the only rule that is efficient, strategy-proof, and individually rational Ma (1994) . Our contribution is to generalize this algorithm to accommodate indifference without compromising on efficiency and incentives.
If 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.
Volume (Year): 147 (2012)
Issue (Month): 5 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/inca/622869|
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.:
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
- Sönmez, Tayfun & Ünver, M. Utku, 2010. "House allocation with existing tenants: A characterization," Games and Economic Behavior, Elsevier, vol. 69(2), pages 425-445, July.
- ALCALDE-UNZU, Jorge & MOLIS, Elena, 2009.
"Exchange of indivisible goods and indifferences: the Top Trading Absorbing Sets mechanisms,"
CORE Discussion Papers
2009062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Alcalde-Unzu, Jorge & Molis, Elena, 2011. "Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms," Games and Economic Behavior, Elsevier, vol. 73(1), pages 1-16, September.
- ALCADE-UNZU, Jorge & MOLIS, Elena, "undated". "Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms," CORE Discussion Papers RP 2331, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Bird, Charles G., 1984. "Group incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 14(4), pages 309-313.
- Pycia, Marek & Ünver, M. Utku, 2017.
"Incentive compatible allocation and exchange of discrete resources,"
Econometric Society, vol. 12(1), January.
- Marek Pycia & M. Utku Ünver, 2009. "Incentive Compatible Allocation and Exchange of Discrete Resources," Boston College Working Papers in Economics 715, Boston College Department of Economics, revised 11 Mar 2014.
- Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- Bogomolnaia, Anna & Deb, Rajat & Ehlers, Lars, 2005. "Strategy-proof assignment on the full preference domain," Journal of Economic Theory, Elsevier, vol. 123(2), pages 161-186, August.
- Thomas Quint & Jun Wako, 2004. "On Houseswapping, the Strict Core, Segmentation, and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 861-877, November.
- Kesten, Onur, 2006. "On two competing mechanisms for priority-based allocation problems," Journal of Economic Theory, Elsevier, vol. 127(1), pages 155-171, March.
- Thomas Quint & Jun Wako, 2004. "On Houseswapping, the Strict Core, Segmentation, and Linear Programming," Yale School of Management Working Papers ysm373, Yale School of Management.
- Tayfun Sonmez, 1999. "Strategy-Proofness and Essentially Single-Valued Cores," Econometrica, Econometric Society, vol. 67(3), pages 677-690, May.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Miyagawa, Eiichi, 2002. "Strategy-Proofness and the Core in House Allocation Problems," Games and Economic Behavior, Elsevier, vol. 38(2), pages 347-361, February.
- Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(1), pages 75-83.
- Ehlers, Lars, 2002. "Coalitional Strategy-Proof House Allocation," Journal of Economic Theory, Elsevier, vol. 105(2), pages 298-317, August.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:147:y:2012:i:5:p:1913-1946. 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: (Dana Niculescu)
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.