The nucleolus of directed acyclic graph games

Balázs Sziklai; Tamás Solymosi; Tamás Fleiner

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.

MoreLess

Year of publication:	2013
Authors:	Sziklai, Balázs ; Solymosi, Tamás ; Fleiner, Tamás
Publisher:	Budapest : Institute of Economics, Hungarian Academy of Sciences
Subject:	Cooperative game theory \| Directed acyclic graphs \| Nucleolus \| Kooperatives Spiel \| Cooperative game \| Spieltheorie \| Game theory \| Graphentheorie \| Graph theory \| Core

freely available

Full text |

More access options

econ.core.hu

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Extent:	Online-Ressource (18 S.) graph. Darst.
Series:	Mu̐helytanulmányok / Magyar Tudományos Akadémia, Közgazdaságtudományi Intézet. - Budapest : [Verlag nicht ermittelbar], ISSN 1785-377X, ZDB-ID 2276849-X. - Vol. 2013/21
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Arbeitspapier ; Working Paper ; Graue Literatur ; Non-commercial literature
Language:	English
Notes:	Zsfassung in ungar. Sprache Systemvoraussetzungen: Acrobat Reader Parallelsacht.: Irányított aciklikus gráfjátékok nukleolusza
ISBN:	978-615-5243-78-3
Other identifiers:	hdl:10419/108315 [Handle]
Classification:	C71 - Cooperative Games
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10009773083