A geometric chracterization of the nucleolus of the assignment game
Maschler 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.
(This abstract was borrowed from another version of this item.)
|Date of creation:||2011|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.ere.ub.es
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.:
- 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.
When requesting a correction, please mention this item's handle: RePEc:bar:bedcje:2011260. 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: (Espai de Recerca en Economia)
If references are entirely missing, you can add them using this form.