128 search results - page 4 / 26 » Computing optimal strategies to commit to in extensive-form ... |
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...
ATAL
2006
Springer
14 years 8 days ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
FSTTCS
2006
Springer
14 years 5 days ago
2006
Springer
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...