Advanced Search
MyIDEAS: Login

Markovian assignment rules

Contents:

Author Info

  • Francis Bloch

    (Department of Economics, Ecole Polytechnique - CNRS : UMR7176 - Polytechnique - X)

  • David Cantala

    (El Colegio de Mexico - El Colegio de México)

Abstract

We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent retires, leaving his object to be reassigned. We define independent assignment rules (where the assignment of an object to an agent is independent of the way other objects are allocated to other agents), efficient assignment rules (where there does not exist another assignment rule with larger expected surplus), and fair assignment rules (where agents experiencing the same circumstances have identical histories in the long run). When agents are homogenous, we characterize efficient, independent and fair rules as generalizations of the seniority rule. When agents draw their types at random, we prove that independence and efficiency are incompatible, and that efficient and fair rules only exist when there are two types of agents. We characterize two simple rules (type-rank and type-seniority) which satisfy both efficiency and fairness criteria in dichotomous settings.

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://hal.archives-ouvertes.fr/docs/00/35/63/04/PDF/cahier_de_recherche_2008-30.pdf
Download Restriction: no

Bibliographic Info

Paper provided by HAL in its series Working Papers with number hal-00356304.

as in new window
Length:
Date of creation: Nov 2008
Date of revision:
Handle: RePEc:hal:wpaper:hal-00356304

Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00356304/en/
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/

Related research

Keywords: dynamic assignment; finite Markov chains; seniority; promotion rules;

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. Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics.
  2. Roth,Alvin E. & Sotomayor,Marilda A. Oliveira, 1992. "Two-Sided Matching," Cambridge Books, Cambridge University Press, number 9780521437882, October.
  3. Dirk Bergemann & Juuso V‰lim‰ki, 2010. "The Dynamic Pivot Mechanism," Econometrica, Econometric Society, vol. 78(2), pages 771-789, 03.
  4. Susan Athey & Ilya Segal, 2007. "An Efficient Dynamic Mechanism," Levine's Bibliography 122247000000001134, UCLA Department of Economics.
  5. Morimitsu Kurino, 2009. "House Allocation with Overlapping Agents: A Dynamic Mechanism Design Approach," Jena Economic Research Papers 2009-075, Friedrich-Schiller-University Jena, Max-Planck-Institute of Economics.
  6. Dirk Bergemann & Juuso Välimäki, 2006. "Efficient Dynamic Auctions," Levine's Bibliography 321307000000000580, UCLA Department of Economics.
  7. David Cantala & Francisco Sánchez, 2008. "Welfare and stability in senior matching markets," International Journal of Game Theory, Springer, vol. 36(3), pages 369-392, March.
  8. Alex Gershkov & Benny Moldovanu, 2009. "Learning about the Future and Dynamic Efficiency," American Economic Review, American Economic Association, vol. 99(4), pages 1576-87, September.
  9. William Thomson, 2007. "Fair Allocation Rules," RCER Working Papers 539, University of Rochester - Center for Economic Research (RCER).
  10. Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
  11. Alex Gershkov & Benny Moldovanu, 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 168-98, August.
  12. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
  13. Cantala, David, 2004. "Restabilizing matching markets at senior level," Games and Economic Behavior, Elsevier, vol. 48(1), pages 1-17, July.
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. Daniel Monte & Norovsambuu Tumennasan, 2012. "Centralized Allocation in Multiple Markets," Economics Working Papers 2012-09, School of Economics and Management, University of Aarhus.
  2. Francis Bloch & Nicolas Houy, 2009. "Optimal Assignment of Durable Objects to Successive Agents," Working Papers hal-00435385, HAL.
  3. Pereyra, Juan Sebastián, 2013. "A dynamic school choice model," Games and Economic Behavior, Elsevier, vol. 80(C), pages 100-114.

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:hal:wpaper:hal-00356304. 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: (CCSD).

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.