Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/108315 
Erscheinungsjahr: 
2013
Schriftenreihe/Nr.: 
IEHAS Discussion Papers No. MT-DP - 2013/21
Verlag: 
Hungarian Academy of Sciences, Institute of Economics, Centre for Economic and Regional Studies, Budapest
Zusammenfassung: 
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.
Schlagwörter: 
Cooperative game theory
Directed acyclic graphs
Nucleolus
JEL: 
C71
ISBN: 
978-615-5243-78-3
Dokumentart: 
Working Paper

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





Publikationen in EconStor sind urheberrechtlich geschützt.