Computing the nucleolus of cyclic permutation games
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Curiel, I. & Tijs, S.H., 1986. "Assignment games and permutation games," Other publications TiSEM c9a47c3b-28d3-4874-b0a2-f, Tilburg University, School of Economics and Management.
- Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(2), pages 119-143.
- Quint, Thomas, 1996. "On One-Sided versus Two-Sided Matching Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 124-134, September.
- Tijs, S.H. & Parthasarathy, T. & Potters, J.A.M. & Rajendra Prasad, V., 1984. "Permutation games : Another class of totally balanced games," Other publications TiSEM a7edfa18-6224-4be3-b677-5, Tilburg University, School of Economics and Management.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Tejada, J. & Borm, P.E.M. & Lohmann, E.R.M.A., 2013. "A Unifying Model for Matching Situations," Discussion Paper 2013-069, Tilburg University, Center for Economic Research.
- Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
- F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB Economics Working Papers 2015/333, Universitat de Barcelona, Facultat d'Economia i Empresa, UB Economics.
- Tejada, O. & Borm, P. & Lohmann, E., 2014. "A unifying model for matrix-based pairing situations," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 55-61.
- Tamás Solymosi, 2015.
"The kernel is in the least core for permutation games,"
Central European Journal of Operations Research,
Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 795-809, December.
- Tamas Solymosi, 2014. "The kernel is in the least core for permutation games," IEHAS Discussion Papers 1402, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- 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.
- van den Brink, René & Katsev, Ilya & van der Laan, Gerard, 2010. "An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure," European Journal of Operational Research, Elsevier, vol. 207(2), pages 817-826, December.
- Lohmann, E.R.M.A., 2012. "Joint decision making and cooperative solutions," Other publications TiSEM 500d8ee1-4f93-4e78-940b-9, Tilburg University, School of Economics and Management.
More about this item
StatisticsAccess and download statistics
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:eee:ejores:v:162:y:2005:i:1:p:270-280. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.