214 search results - page 3 / 43 » Finding Optimal Strategies for Imperfect Information Games |
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...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ļ¬...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Reļ¬nement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the ļ¬rst player can ensure to win and, if so, it constructs...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...