The Nucleolus of Directed Acyclic Graph Games

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 : Hungarian Academy of Sciences, Institute of Economics, Centre for Economic and Regional Studies
Subject:	Cooperative game theory \| Directed acyclic graphs \| Nucleolus

More details

Series:	IEHAS Discussion Papers ; MT-DP - 2013/21
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
ISBN:	978-615-5243-78-3
Other identifiers:	756334845 [GVK] hdl:10419/108315 [Handle] RePEc:has:discpr:1321 [RePEc]
Classification:	C71 - Cooperative Games
Source:	EconStor

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