Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Nash Stability in the Hedonic Coalition Formation Games

Published 14 May 2014 in cs.GT | (1405.3360v2)

Abstract: This paper studies the Nash stability in hedonic coalition formation games. We address the following issue: for a general problem formulation, is there any utility allocation method ensuring a Nash-stable partition? We propose the definition of the Nash-stable core. We study the conditions for having a non-empty Nash-stable core. More precisely, we show how relaxed efficiency in utility sharing method allows to ensure a non-empty Nash-stable core.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.