Sciweavers

60 search results - page 3 / 12
» On the computational complexity of coalitional resource game...
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 4 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 4 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
ATAL
2008
Springer
13 years 8 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
14 years 6 days ago
Multi-attribute coalitional games
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
Samuel Ieong, Yoav Shoham
MAAMAW
1993
Springer
13 years 10 months ago
Coalition Formation Among Autonomous Agents: Strategies and Complexity
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
Onn Shehory, Sarit Kraus