Characterization sets for the nucleolus
Author
Abstract
Suggested Citation
Note: Received May 1994/Revised version May 1997/Final version February 1998
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Balázs Sziklai & Tamás Fleiner & Tamás Solymosi, 2014. "On the Core of Directed Acyclic Graph Games," CERS-IE WORKING PAPERS 1418, Institute of Economics, Centre for Economic and Regional Studies.
- Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005.
"Strongly essential coalitions and the nucleolus of peer group games,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 447-460, September.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003. "Strongly Essential Coalitions and the Nucleolus of Peer Group Games," Discussion Paper 2003-19, Tilburg University, Center for Economic Research.
- Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003. "Strongly Essential Coalitions and the Nucleolus of Peer Group Games," Other publications TiSEM d2db812a-b13a-4e83-9198-2, Tilburg University, School of Economics and Management.
- Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
- Olivier Massol & Stéphane Tchung-Ming, 2009. "Stratégies coopératives dans l'industrie du GNL : l'argument de la rationalisation est-il fondé ?," Working Papers hal-02469480, HAL.
- Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
- repec:has:discpr:1321 is not listed on IDEAS
- Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
- D. Granot & H. Hamers & J. Kuipers & M. Maschler, 2004. "Chinese Postman Games on a Class of Eulerian Graphs," Discussion Paper Series dp366, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Massol, Olivier & Tchung-Ming, Stéphane, 2010. "Cooperation among liquefied natural gas suppliers: Is rationalization the sole objective?," Energy Economics, Elsevier, vol. 32(4), pages 933-947, July.
- Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
More about this item
Keywords
Cooperative game · nucleolus · strongly polynomial algorithms · minimum cost spanning tree games;Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:27:y:1998:i:3:p:359-374. See general information about how to correct material in RePEc.
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.
We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.