Sciweavers

1698 search results - page 34 / 340
» Growing Complex Games
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ATAL
2007
Springer
15 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
104
Voted
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...
88
Voted
IJAOSE
2010
183views more  IJAOSE 2010»
14 years 7 months ago
O-MaSE: a customisable approach to designing and building complex, adaptive multi-agent systems
: The complexity and scope of software systems continues to grow. One approach to dealing with this growing complexity is the use of intelligent, multi-agent systems. However, due ...
Scott A. DeLoach, Juan C. García-Ojeda
IADIS
2004
14 years 11 months ago
Challenges for Network Computer Games
Interactive entertainment and specifically computer games has grown into a multi-billion industry in the last few years and continues to grow. This expansion has fueled a number o...
Yusuf Pisan