Sciweavers

128 search results - page 10 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
16 years 18 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
TCIAIG
2010
15 years 23 days ago
The Design of Puzzle Selection Strategies for ESP-Like GWAP Systems
The `Games With A Purpose' (GWAP) genre is a type of `Human Computation' that outsources certain steps of the computational process to humans. Although most GWAP studies ...
Ling-Jyh Chen, Bo-Chun Wang, Wen-Yuan Zhu
LICS
2005
IEEE
15 years 11 months ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
FORMATS
2005
Springer
15 years 11 months ago
Average Reward Timed Games
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
B. Thomas Adler, Luca de Alfaro, Marco Faella
ATAL
2007
Springer
16 years 6 days ago
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament
We analyze a heads-up no-limit Texas Hold’em poker tournament with a fixed small blind of 300 chips, a fixed big blind of 600 chips and a total amount of 8000 chips on the tab...
Peter Bro Miltersen, Troels Bjerre Sørensen