Sciweavers

47 search results - page 4 / 10
» Simple Negotiating Agents in Complex Games:
Sort
View
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Complexity of determining nonemptiness of the core
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...
Vincent Conitzer, Tuomas Sandholm
ATAL
2008
Springer
14 years 11 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
AAAI
1996
14 years 10 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
ATAL
2009
Springer
15 years 4 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...
114
Voted
TCS
2010
14 years 7 months ago
Analyzing the dynamics of stigmergetic interactions through pheromone games
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
Peter Vrancx, Katja Verbeeck, Ann Nowé