Characterization sets for the nucleolus

We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a sequential LP process, and derive a general relationship between the size of a characterization set and the complexity of computing the nucleolus.

MoreLess

Year of publication:	1998-11-02
Authors:	Granot, D. ; Granot, F. ; Zhu, W. R.
Published in:	International Journal of Game Theory. - Springer. - Vol. 27.1998, 3, p. 359-374
Publisher:	Springer
Subject:	Cooperative game \| nucleolus \| strongly polynomial algorithms \| minimum cost spanning tree games

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Notes:	Received May 1994/Revised version May 1997/Final version February 1998
Source:	RePEc - Research Papers in Economics

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