Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86704
Authors: 
van den Brink, René
Katsev, Ilya
van der Laan, Gerard
Year of Publication: 
2008
Series/Report no.: 
Tinbergen Institute Discussion Paper 08-060/1
Abstract: 
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.
Subjects: 
TU-game
nucleolus
game with permission structure
peer group game
information market game
algorithm
complexity
JEL: 
C71
Document Type: 
Working Paper

Files in This Item:
File
Size
336.59 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.