Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/108315
Authors: 
Sziklai, Balázs
Solymosi, Tamás
Fleiner, Tamás
Year of Publication: 
2013
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2013/21
Abstract: 
In this paper we consider a natural generalization of standard tree games where the underlying structure is a directed acyclic graph. We analyze the properties of the game and illustrate its relation with other graph based cost games. We show that although the game is not convex its core is always non-empty. Furthermore we provide a painting algorithm for large families of directed acyclic graph games that finds the nucleolus in polynomial time.
Subjects: 
Cooperative game theory
Directed acyclic graphs
Nucleolus
JEL: 
C71
ISBN: 
978-615-5243-78-3
Document Type: 
Working Paper

Files in This Item:
File
Size
675.25 kB





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