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

Paths to Stability in the Assignment Problem

Contents:

Author Info

  • Bettina Klaus
  • Frédéric Payot

Abstract

We study a labor market with finitely many heterogeneous workers and firms to illustrate the decentralized (myopic) blocking dynamics in two-sided one-to-one matching markets with continuous side payments (assignment problems, Shapley and Shubik, 1971). A labor market is unstable if there is at least one blocking pair, that is, a worker and a firm who would prefer to be matched to each other in order to obtain higher payoffs than the payoffs they obtain by being matched to their current partners. A blocking path is a sequence of outcomes (specifying matchings and payoffs) such that each outcome is obtained from the previous one by satisfying a blocking pair (i.e., by matching the two blocking agents and assigning new payoffs to them that are higher than the ones they received before). We are interested in the question if starting from any (unstable) outcome, there always exists a blocking path that will lead to a stable outcome. In contrast to discrete versions of the model (i.e., for marriage markets, one-to-one matching, or discretized assignment problems), the existence of blocking paths to stability cannot always be guaranteed. We identify a necessary and sufficient condition for an assignment problem (the existence of a stable outcome such that all matched agents receive positive payoffs) to guarantee the existence of paths to stability and show how to construct such a path whenever this is possible.

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://www.hec.unil.ch/deep/textes/13.14.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Université de Lausanne, Faculté des HEC, DEEP in its series Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) with number 13.14.

as in new window
Length: 35 pp.
Date of creation: Sep 2013
Date of revision:
Handle: RePEc:lau:crdeep:13.14

Contact details of provider:
Postal: Université de Lausanne, Faculté des HEC, DEEP, Internef, CH-1015 Lausanne
Phone: ++41 21 692.33.64
Fax: ++41 21 692.33.05
Email:
Web page: http://www.hec.unil.ch/deep/publications/cahiers/series
More information through EDIRC

Related research

Keywords: Assignment problem; competitive equilibria; core; decentralized market; random path; stability;

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. Effrosyni Diamantoudi & Eiichi Miyagawa & Licun Xue, 2002. "Random paths to stability in the roommate problem," Discussion Papers 0102-65, Columbia University, Department of Economics.
  2. Schwarz, Michael & Yenmez, M. Bumin, 2011. "Median stable matching for markets with wages," Journal of Economic Theory, Elsevier, vol. 146(2), pages 619-637, March.
  3. John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966 - 1005.
  4. Jun Wako, 2006. "Another proof that assignment games have singleton cores only if multiple optimal matchings exist," Economic Theory, Springer, vol. 29(1), pages 213-217, September.
  5. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
  6. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
  7. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
  8. Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-80, November.
  9. Bo Chen & Satoru Fujishige & Zaifu Yang, 2011. "Decentralized Market Processes to Stable Job Matchings with Competitive Salaries," Discussion Papers 11/03, Department of Economics, University of York.
  10. Sotomayor, Marilda, 2003. "Some further remark on the core structure of the assignment game," Mathematical Social Sciences, Elsevier, vol. 46(3), pages 261-265, December.
  11. Klaus, Bettina & Klijn, Flip, 2007. "Paths to stability for matching markets with couples," Games and Economic Behavior, Elsevier, vol. 58(1), pages 154-171, January.
  12. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," IEHAS Discussion Papers 1211, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
  13. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
  14. Ning Sun & Zaifu Yang, 2009. "A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements," Econometrica, Econometric Society, vol. 77(3), pages 933-952, 05.
  15. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-88, July.
Full references (including those not matched with items on IDEAS)

Citations

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:lau:crdeep:13.14. 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: (Claudine Delapierre Saudan).

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.