Markovian assignment rules
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.
|Date of creation:||Dec 2010|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.colmex.mx/centros/cee/|
More information through EDIRC
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.:
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003.
Game Theory and Information
- Susan Athey & Ilya Segal, 2007.
"An Efficient Dynamic Mechanism,"
122247000000001134, UCLA Department of Economics.
- Dirk Bergemann & Juuso Välimäki, 2008.
"The Dynamic Pivot Mechanism,"
Levine's Working Paper Archive
122247000000002340, David K. Levine.
- Dirk Bergemann & Juuso Valimaki, 2008. "The Dynamic Pivot Mechanism," Cowles Foundation Discussion Papers 1672R, Cowles Foundation for Research in Economics, Yale University, revised Dec 2009.
- Dirk Bergemann & Juuso Valimaki, 2008. "The Dynamic Pivot Mechanism," Cowles Foundation Discussion Papers 1672, Cowles Foundation for Research in Economics, Yale University.
- David Cantala & Francisco Sánchez, 2008. "Welfare and stability in senior matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 369-392, March.
- Cantala, David, 2004. "Restabilizing matching markets at senior level," Games and Economic Behavior, Elsevier, vol. 48(1), pages 1-17, July.
- Roth, Alvin E. & Sotomayor, Marilda, 1992.
Handbook of Game Theory with Economic Applications,
in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541
- 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.
- 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.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- Dirk Bergemann & Juuso Valimaki, 2006.
"Efficient Dynamic Auctions,"
Cowles Foundation Discussion Papers
1584, Cowles Foundation for Research in Economics, Yale University.
- William Thomson, 2007. "Fair Allocation Rules," RCER Working Papers 539, University of Rochester - Center for Economic Research (RCER).
- Morimitsu Kurino, 2009. "House Allocation with Overlapping Agents: A Dynamic Mechanism Design Approach," Jena Economic Research Papers 2009-075, Friedrich-Schiller-University Jena.
- M. Utku Ünver, 2010. "Dynamic Kidney Exchange," Review of Economic Studies, Oxford University Press, vol. 77(1), pages 372-414.
- Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics.
- 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.
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:emx:ceedoc:2010-18. 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: (Rocío Contreras Romo)
If references are entirely missing, you can add them using this form.