The assignment game: core bounds for mixe-pair coalitions
AbstractIn the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyerseller exact games and satisfy the condition that each mixedpair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyerseller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyerseller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixedpair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a 45olattice by means of the core of an assignment game can now be answered.
Download InfoIf 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.
Bibliographic InfoPaper provided by Universitat de Barcelona. Espai de Recerca en Economia in its series Working Papers in Economics with number 84.
Length: 19 pages
Date of creation: 2002
Date of revision:
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
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation
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.:
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Espai de Recerca en Economia).
If references are entirely missing, you can add them using this form.