1410 search results - page 4 / 282 » The Algorithmics of Solitaire-Like Games |
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
168
click to vote
Book
Classic book on Algorithmic aspects of Game theory and mechanism design
ITA
2002
14 years 9 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
ISAAC
2005
Springer
15 years 2 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
CG
2010
Springer
14 years 7 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...