A geometric chracterization of the nucleolus of the assignment game
AbstractMaschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his/her optimally matched partner equals the maximum amount that he/she can receive from this partner, also remaining inside the core (Rochford, 1984). We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions.
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 260.
Length: 0 pages
Date of creation: 2011
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
Other versions of this item:
- Francesc Llerena & Marina Nunez, 2011. "A geometric characterization of the nucleolus of the assignment game," Economics Bulletin, AccessEcon, vol. 31(4), pages 3275-3285.
- 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
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.
- Francesc Llerena (Universitat Rovira i Virgili - CREIP) & Marina Nunez (Universitat de Barcelona) & Carles Rafels (Universitat de Barcelona), 2012. "An axiomatization of the nucleolus of the assignment game," Working Papers in Economics 286, Universitat de Barcelona. Espai de Recerca en Economia.
- F. Javier Martinez de Albeniz & Carles Rafels & Neus Ybern, 2013.
"On the nucleolus of 2 x 2 assignment games,"
Working Papers in Economics
289, Universitat de Barcelona. Espai de Recerca en Economia.
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.