22 search results - page 1 / 5 » Computing Weakest Strategies for Safety Games of Imperfect I... |
TACAS
2009
Springer
14 years 6 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
CONCUR
2009
Springer
14 years 5 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
CONCUR
2008
Springer
14 years 29 days ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
Lecture Notes
These are game theory notes from LSE. They cover the following topics: Nim and combinatorial games, Games as trees and in strategic form, Mixed strategy equilibria,
Game trees wit...
JACM
2007
13 years 11 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...