Advanced Search
MyIDEAS: Login to save this paper or follow this series

Efficient Priority Rules

Contents:

Author Info

  • Lars Ehlers
  • Bettina Klaus

    ()

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 renegotiation-proofness. 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://pareto.uab.es/wp/2002/55402.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC) in its series UFAE and IAE Working Papers with number 554.02.

as in new window
Length: 14
Date of creation: 09 Dec 2002
Date of revision:
Handle: RePEc:aub:autbar:554.02

Contact details of provider:
Postal: 08193, Bellaterra, Barcelona
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Email:
Web page: http://pareto.uab.cat
More information through EDIRC

Related research

Keywords: acyclical priority 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. 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.
  2. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
  3. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
  4. 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).
  5. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
  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. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
  9. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation," Working Papers 33, Barcelona Graduate School of Economics.
  10. Ergin, Haluk I., 2000. "Consistency in house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 34(1), pages 77-97, August.
  11. Atila Abdulkadiroglu & Tayfun Smez, 2003. "School Choice: A Mechanism Design Approach," Discussion Papers 0203-18, Columbia University, Department of Economics.
  12. Lars Ehlers & Bettina Klaus, 2007. "Consistent House Allocation," Economic Theory, Springer, vol. 30(3), pages 561-574, March.
  13. 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.
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:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

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:aub:autbar:554.02. 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: (Xavier Vila).

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.