Advanced Search
MyIDEAS: Login

Efficient Priority Rules

Contents:

Author Info

  • EHLERS, Lars
  • KLAUS, Bettina

Abstract

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

Download Info

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.
File URL: http://hdl.handle.net/1866/502
Download Restriction: no

Bibliographic Info

Paper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2003-13.

as in new window
Length: 14 pages
Date of creation: 2003
Date of revision:
Handle: RePEc:mtl:montde:2003-13

Contact details of provider:
Postal: CP 6128, Succ. Centre-Ville, Montréal, Québec, H3C 3J7
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC

Related research

Keywords: acyclical iority structures; indivisible objects;

Other versions of this item:

Find related papers by JEL classification:

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. Lars Ehlers & Bettina Klaus, 2004. "Resource-monotonicity for house allocation problems," International Journal of Game Theory, Springer, vol. 32(4), pages 545-560, 08.
  2. Ehlers, Lars & Klaus, Bettina & Papai, Szilvia, 2002. "Strategy-proofness and population-monotonicity for house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 38(3), pages 329-339, November.
  3. Atila Abdulkadiroglu & Tayfun Smez, 2003. "School Choice: A Mechanism Design Approach," Discussion Papers 0203-18, Columbia University, Department of Economics.
  4. Lars Ehlers & Bettina Klaus, 2007. "Consistent House Allocation," Economic Theory, Springer, vol. 30(3), pages 561-574, March.
  5. Ergin, Haluk I., 2000. "Consistency in house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 34(1), pages 77-97, August.
  6. Ehlers, Lars, 2002. "Coalitional Strategy-Proof House Allocation," Journal of Economic Theory, Elsevier, vol. 105(2), pages 298-317, August.
  7. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
  8. 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.
  9. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
  10. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
  11. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
  12. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
  13. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation," Working Papers 33, Barcelona Graduate School of Economics.
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. Alvin E. Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
  2. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation Problems," UFAE and IAE Working Papers 566.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  3. Ergin, Haluk & Sonmez, Tayfun, 2006. "Games of school choice under the Boston mechanism," Journal of Public Economics, Elsevier, vol. 90(1-2), pages 215-237, January.
  4. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
  5. Fuhito Kojima & M. Ünver, 2014. "The “Boston” school-choice mechanism: an axiomatic approach," Economic Theory, Springer, vol. 55(3), pages 515-544, April.
  6. EHLERS, Lars & KLAUS, Bettina, 2009. "Allocation via Deferred-Acceptance under Responsive Priorities," Cahiers de recherche 2009-16, Universite de Montreal, Departement de sciences economiques.
  7. Bettina Klaus & Flip Klijn, 2011. "Local and Global Consistency Properties for Student Placement," UFAE and IAE Working Papers 866.11, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  8. Bettina Klaus & Flip Klijn, 2007. "Fair and efficient student placement with couples," International Journal of Game Theory, Springer, vol. 36(2), pages 177-207, October.
  9. William Thomson, 2011. "Consistency and its converse: an introduction," Review of Economic Design, Springer, vol. 15(4), pages 257-291, December.
  10. Onur Kesten & Ayşe Yazıcı, 2012. "The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods," Economic Theory, Springer, vol. 50(2), pages 463-488, June.

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:mtl:montde:2003-13. 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: (Sharon BREWER).

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.