The maximum and the addition of assignment games
In the framework of two-sided assignment markets, we first consider that among several markets, the players may choose where to trade. It is shown that the corresponding game, represented by the maximum of a finite set of assignment games, may not be balanced. Some conditions for balancedness are provided and, in that case, properties of the core are analyzed. Secondly, we consider that players may trade simultaneously in more than one market and then add the profits. The corresponding game, represented by the sum of a finite set of assignment games, is balanced. Moreover, under some conditions, the sum of the cores of two assignment games coincides with the core of the sum game.
(This abstract was borrowed from another version of this item.)
Volume (Year): 19 (2011)
Issue (Month): 1 (July)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=120409|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- 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.
- 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.
- 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:spr:topjnl:v:19:y:2011:i:1:p:189-212. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.