An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure

DOI10.1016/J.EJOR.2010.05.028zbMath1205.91026OpenAlexW2086528931MaRDI QIDQ992684

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

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.028

zbMATH Keywords

algorithmgame theorynucleolusTU-gamepeer group gameacyclic permission structure

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (3)

Optimal coalition formation and surplus distribution: two sides of one coin ⋮ Games with a permission structure -- a survey on generalizations and applications ⋮ Some solutions for generalized games with restricted cooperation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the nucleolus of cyclic permutation games
• Information market games
• Games with permission structures: The conjunctive approach
• 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
• Electronic commerce, marketing channels and logistics platforms -- a wholesaler perspective
• On the nucleolus of neighbor 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

This page was built for publication: An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure