Arbeitspapier

Computation of the Nucleolus for a Class of Disjunctive Games with a Permission Structure

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a situation in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with permission structure.

Language
Englisch

Bibliographic citation
Series: Tinbergen Institute Discussion Paper ; No. 08-060/1

Classification
Wirtschaft
Cooperative Games
Subject
TU-game
nucleolus
game with permission structure
peer group game
information market game
algorithm
complexity
Transferable Utility Games
Core
Kooperatives Spiel
Informationsmarkt
Soziale Beziehungen
Theorie

Event
Geistige Schöpfung
(who)
van den Brink, René
Katsev, Ilya
van der Laan, Gerard
Event
Veröffentlichung
(who)
Tinbergen Institute
(where)
Amsterdam and Rotterdam
(when)
2008

Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • van den Brink, René
  • Katsev, Ilya
  • van der Laan, Gerard
  • Tinbergen Institute

Time of origin

  • 2008

Other Objects (12)