Sciweavers

230 search results - page 1 / 46
» Computing Optimal Strategies to Commit to in Stochastic Game...
Sort
View
AAAI
2012
11 years 6 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
13 years 11 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
CONCUR
2006
Springer
13 years 8 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger