Sciweavers

119 search results - page 4 / 24
» Average Reward Timed Games
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months 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
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
AAAI
2008
13 years 9 months ago
Unknown Rewards in Finite-Horizon Domains
"Human computation" is a recent approach that extracts information from large numbers of Web users. reCAPTCHA is a human computation project that improves the process of...
Colin McMillen, Manuela M. Veloso
IWEC
2010
13 years 9 months ago
The 'Interactive' of Interactive Storytelling: Customizing the Gaming Experience
In this article, we define interactive storytelling as a gaming experience where the form and content of the game is customized in real time and tailored to the preferences and ne...
Barbaros Bostan, Tim Marsh
ATAL
2007
Springer
14 years 1 months ago
An adaptive strategy for minority games
Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the ...
Ka-man Lam, Ho-fung Leung