Sciweavers

309 search results - page 10 / 62
» Path coalitional games
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 6 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
AAAI
2008
13 years 10 months ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ATAL
2006
Springer
13 years 11 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2007
Springer
14 years 1 months ago
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability conc...
Georgios Chalkiadakis, Evangelos Markakis, Craig B...
ECAI
2008
Springer
13 years 9 months ago
Coalition Structures in Weighted Voting Games
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
Edith Elkind, Georgios Chalkiadakis, Nicholas R. J...