38 search results - page 3 / 8 » On the computational complexity of qualitative coalitional g... |
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
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...
AI
2006
Springer
13 years 5 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
AAAI
2008
13 years 8 months ago
2008
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, ...
SIGECOM
2003
ACM
13 years 11 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...