1410 search results - page 133 / 282 » The Algorithmics of Solitaire-Like Games |
FSTTCS
2008
Springer
15 years 19 days ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
121
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
100
click to vote
ENDM
2010
14 years 11 months ago
2010
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
SODA
2004
ACM
15 years 28 days ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...