Sciweavers

5995 search results - page 59 / 1199
» Algorithmic Game Theory
Sort
View
IJCAI
2003
15 years 1 months ago
A Continuation Method for Nash Equilibria in Structured Games
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
Ben Blum, Christian R. Shelton, Daphne Koller
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
92
Voted
AI
2007
Springer
14 years 11 months ago
An economist's perspective on multi-agent learning
We comment on the Shoham, Powers, and Grenager survey of multi-agent learning and game theory, emphasizing that some of their categories are important for economics and others are...
Drew Fudenberg, David K. Levine
GECCO
2010
Springer
244views Optimization» more  GECCO 2010»
14 years 12 months ago
Implicit fitness and heterogeneous preferences in the genetic algorithm
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
Justin T. H. Smith
98
Voted
CORR
2006
Springer
103views Education» more  CORR 2006»
14 years 11 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz