On the dimension of the core of the assignment game

This file is part of IDEAS, which uses RePEc data

On the dimension of the core of the assignment game

Author Info

Marina Nunez Oliva
Carlos Rafels Pallarola (Universitat de Barcelona)

Abstract

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

Publisher Info
Paper provided by Universitat de Barcelona. Espai de Recerca en Economia in its series Working Papers in Economics with number 167.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 25 pages
Date of creation: 2006
Date of revision:
Handle: RePEc:bar:bedcje:2006167

Contact details of provider:
Postal: Espai de Recerca en Economia, Facultat de CiÃ¨ncies EconÃ²miques. Tinent Coronel Valenzuela, Num 1-11 08034 Barcelona. Spain.
Web page: http://www.ere.ub.es
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Espai de Recerca en Economia).

Related research
Keywords:

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

This paper has been announced in the following NEP Reports:

NEP-ALL-2006-12-16 (All new papers)
NEP-GTH-2006-12-16 (Game Theory)

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.:

Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer, vol. 23(2), pages 119-43.
Theo S. H. Driessen, 1998. "A note on the inclusion of the kernel in the core of the bilateral assignment game," International Journal of Game Theory, Springer, vol. 27(2), pages 301-303. [Downloadable!] (restricted)
T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185. [Downloadable!] (restricted)
Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-79, June. [Downloadable!] (restricted)

Full references

Statistics
Access and download statistics

Did you know? Over five million full texts a year are downloaded through IDEAS.

This page was last updated on 2009-11-11.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.