A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure

DOI10.1007/s00182-010-0257-3zbMath1274.91058OpenAlexW2091012329MaRDI QIDQ637584

Gerard van der Laan, René van den Brink, Ilya V. Katsev

Publication date: 6 September 2011

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-010-0257-3

zbMATH Keywords

complexityalgorithmnucleolusgame with permission structureinformation market gamepeer group game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (4)

Games with a permission structure -- a survey on generalizations and applications ⋮ Weighted nucleoli and dually essential coalitions ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus

Cites Work

• Unnamed Item
• Unnamed Item
• Information market games
• On the regions of linearity for the nucleolus and their computation
• Games with permission structures: The conjunctive approach
• A characterization of the nucleolus for convex games
• The \({\mathcal B}\)-nucleolus of TU-games
• An axiomatization of the disjunctive permission value for games with a permission structure
• The nucleolus and kernel of veto-rich transferable utility games
• Tree-connected peer group situations and peer group games
• Computing the nucleolus of some combinatorially-structured games.
• Axiomatizations of the conjunctive permission value for games with permission structures
• Sharing a polluted river
• Strongly essential coalitions and the nucleolus of peer group games
• Graphs and Cooperation in Games
• The Nucleolus of a Characteristic Function Game
• The kernel of a cooperative game
• On the Nucleolus of a Characteristic Function Game

This page was built for publication: A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure