Sciweavers

25 search results - page 1 / 5
» Algorithms for Omega-Regular Games with Imperfect Informatio...
Sort
View
CSL
2006
Springer
13 years 8 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
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...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
JACM
2007
160views more  JACM 2007»
13 years 4 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
TACAS
2009
Springer
157views Algorithms» more  TACAS 2009»
13 years 11 months ago
Alpaga: A Tool for Solving Parity Games with Imperfect Information
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
Dietmar Berwanger, Krishnendu Chatterjee, Martin D...
AAAI
2006
13 years 6 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian