The Nucleolus and Kernel of Veto-Rich Transferable Utility Games
The process of computing the nucleolus of arbitrary transferable utility games is notoriously hard. A number of papers have appeared in which the nucleolus is computed by an algorithm in which either one or a huge number of huge linear programs have to be solved. We show that on the class of veto-rich games, the nucleolus is the unique kernel element. Veto-rich games are games in which one of the players is needed by coalitions in order to obtain a non-zero payoff. We then provide a fast algorithm which does not use linear programming techniques to compute the nucleolus of these games. Furthermore, we provide a few examples of economic situations which belong to the class of veto-rich games and which are treated in the literature.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 26 (1997)
Issue (Month): 1 ()
|Note:||Received May 1994 Revised version May 1995|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:26:y:1997:i:1:p:61-73. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.