230 search results - page 6 / 46 » Computing Optimal Strategies to Commit to in Stochastic Game... |
FSTTCS
2006
Springer
13 years 11 months 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 ...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
AAAI
2004
13 years 9 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...