Random assignment under weak preferences
AbstractThe natural preference domain for many practical settings of the assignment problems is the one in which agents are allowed to be indifferent between objects, the weak preference domain. Most of the existing work on assignment problems assumes strict preferences. There are important exceptions, but they provide solutions only to the assignment problems with a social endowment, where agents own objects collectively and there are no private endowments. We consider the general class of assignment problems with private endowments and a social endowment. Our main contribution is a recursive solution for the weak preference domain. Our solution satisfies individual rationality, ordinal efficiency and a recently introduced fairness axiom, no justified-envy.
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): 66 (2009)
Issue (Month): 1 (May)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Random assignment Ordinal efficiency No justified-envy Parametric maximum flow algorithm;
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.:
- Moulin, Herve & Bogomolnaia, Anna, 2001.
"Random Matching under Dichotomous Preferences,"
2001-03, Rice University, Department of Economics.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003.
NBER Working Papers
10002, National Bureau of Economic Research, Inc.
- Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer, vol. 23(1), pages 75-83.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004.
"Pairwise Kidney Exchange,"
NBER Working Papers
10698, National Bureau of Economic Research, Inc.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Game Theory and Information 0408001, EconWPA, revised 16 Feb 2005.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Boston College Working Papers in Economics 620, Boston College Department of Economics.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," Levine's Bibliography 122247000000000350, UCLA Department of Economics.
- 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.
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- Ãœnver, M. Utku & SÃ¶nmez, Tayfun & Roth, Alvin, 2007.
"Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences,"
2562809, Harvard University Department of Economics.
- Tayfun Sönmez & Alvin E. Roth & M. Utku Ünver, 2007. "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences," American Economic Review, American Economic Association, vol. 97(3), pages 828-851, June.
- Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
- M.Utku Unver, 2006.
"Kidney Exchange with Good Samaritan Donors: A Characterization,"
255, University of Pittsburgh, Department of Economics, revised Jan 2006.
- Tayfun Sönmez & M. Utku Ünver, 2006. "Kidney Exchange with Good Samaritan Donors: A Characterization," Boston College Working Papers in Economics 640, Boston College Department of Economics.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Tayfun Sönmez & M. Utku Ünver, 2001.
"House Allocation with Existing Tenants: An Equivalence,"
Game Theory and Information
0112002, EconWPA, revised 26 Sep 2002.
- Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
- Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- Zhou, Lin, 1990. "On a conjecture by gale about one-sided matching problems," Journal of Economic Theory, Elsevier, vol. 52(1), pages 123-135, October.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- Stergios Athanassoglou & Jay Sethuraman, 2011.
"House allocation with fractional endowments,"
International Journal of Game Theory,
Springer, vol. 40(3), pages 481-513, August.
- HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013.
"Assigning agents to a line,"
CORE Discussion Papers
2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, Universidad de Alicante, Departamento de Métodos Cuantitativos y Teoría Económica.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.