Sciweavers

5995 search results - page 5 / 1199
» Algorithmic Game Theory
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 7 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
SAGT
2009
Springer
308views Game Theory» more  SAGT 2009»
14 years 1 months ago
Partition Equilibrium
Michal Feldman, Moshe Tennenholtz
SAGT
2009
Springer
338views Game Theory» more  SAGT 2009»
14 years 1 months ago
Computational Aspects of Equilibria
Mihalis Yannakakis
SAGT
2010
Springer
348views Game Theory» more  SAGT 2010»
13 years 5 months ago
No Regret Learning in Oligopolies: Cournot vs. Bertrand
Uri Nadav, Georgios Piliouras