Sciweavers

36 search results - page 1 / 8
» Computational Complexity of Weighted Threshold Games
Sort
View
AAAI
2007
13 years 6 months ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AAAI
2008
13 years 6 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
2009
Springer
13 years 11 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
ATAL
2010
Springer
13 years 5 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
ECAI
2008
Springer
13 years 6 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...