1410 search results - page 111 / 282 » The Algorithmics of Solitaire-Like Games |
111
click to vote
SAGT
2010
Springer
14 years 9 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
106
click to vote
ECCC
2006
14 years 11 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
105
click to vote
CG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...