230 search results - page 3 / 46 » Computing Optimal Strategies to Commit to in Stochastic Game... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
116
click to vote
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
P2P
2005
IEEE
15 years 3 months ago
2005
IEEE
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...