Sciweavers

5995 search results - page 77 / 1199
» Algorithmic Game Theory
Sort
View
ATAL
2006
Springer
15 years 5 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
AIIA
2007
Springer
15 years 7 months ago
Towards Automated Game Design
Abstract. Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the rule system of the game and the visual real...
Mark J. Nelson, Michael Mateas
ITA
2002
163views Communications» more  ITA 2002»
15 years 1 months ago
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
Julien Bernet, David Janin, Igor Walukiewicz
ATAL
1997
Springer
15 years 5 months ago
Multi-Agent Coordination through Coalition Formation
Incorporating coalition formation algorithms into agent systems shall be advantageous due to the consequent increase in the overall quality of task performance. Coalition formatio...
Onn Shehory, Katia P. Sycara, Somesh Jha
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
15 years 7 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...