Sciweavers

45 search results - page 5 / 9
» Stable partitions in coalitional games
Sort
View
CIE
2007
Springer
14 years 1 months ago
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
Martin Olsen
MFCS
2009
Springer
14 years 2 months ago
The Cost of Stability in Network Flow Games
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey...
ECAI
2010
Springer
13 years 8 months ago
Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
Abstract. Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the...
Tomasz P. Michalak, Talal Rahwan, Dorota Marciniak...
MSS
2008
IEEE
96views Hardware» more  MSS 2008»
13 years 7 months ago
Farsighted coalitional stability in TU-games
Abstract. We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest ...
Sylvain Béal, Jacques Durieu, Philippe Sola...
ECAI
2006
Springer
13 years 11 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings