Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/86704 
Erscheinungsjahr: 
2008
Schriftenreihe/Nr.: 
Tinbergen Institute Discussion Paper No. 08-060/1
Verlag: 
Tinbergen Institute, Amsterdam and Rotterdam
Zusammenfassung: 
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.
Schlagwörter: 
TU-game
nucleolus
game with permission structure
peer group game
information market game
algorithm
complexity
JEL: 
C71
Dokumentart: 
Working Paper
Erscheint in der Sammlung:

Datei(en):
Datei
Größe
336.59 kB





Publikationen in EconStor sind urheberrechtlich geschützt.