Sciweavers

1503 search results - page 76 / 301
» Generalized Parity Games
Sort
View
JMLR
2010
105views more  JMLR 2010»
13 years 4 months ago
Causal Discovery as a Game
This paper presents a game theoretic approach to causal discovery. The problem of causal discovery is framed as a game of the Scientist against Nature, in which Nature attempts to...
Frederick Eberhardt
ATAL
2008
Springer
13 years 11 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
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...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
STACS
2010
Springer
14 years 4 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
SASO
2009
IEEE
14 years 3 months ago
Teleological Software Adaptation
—We examine the use of teleological metareasoning for self-adaptation in game-playing software agents. The goal of our work is to develop an interactive environment in which the ...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 3 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...