The Maximal Payoff and Coalition Formation in Coalitional Games
This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition’s payoff v(N), or if and only if it is irrational to split v(N). It then provides answers to the questions of what payoffs to split, how to split the payoff, what coalitions to form, and how long each of the coalitions will be formed by rational players in coalitional TU games. Finally, it obtains analogous results in coalitional NTU (non-transferable utility) games.
|Date of creation:||Mar 2008|
|Contact details of provider:|| Postal: Corso Magenta, 63 - 20123 Milan|
Web page: http://www.feem.it/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2008.27. 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: (barbara racah)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.