On the nucleolus of 2 x 2 assignment games
We provide explicit formulas for the nucleolus of an arbitrary assignment game with two buyers and two sellers. Five different cases are analyzed depending on the entries of the assignment matrix. We extend the results to the case of 2 m or m 2 assignment games.
|Date of creation:||2013|
|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.
- Francesc Llerena & Marina Nunez & Carles Rafels, 2011.
"A geometric chracterization of the nucleolus of the assignment game,"
Working Papers in Economics
260, Universitat de Barcelona. Espai de Recerca en Economia.
- Francesc Llerena & Marina Nunez, 2011. "A geometric characterization of the nucleolus of the assignment game," Economics Bulletin, AccessEcon, vol. 31(4), pages 3275-3285.
When requesting a correction, please mention this item's handle: RePEc:bar:bedcje:2013289. 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.