Skip to Main content Skip to Navigation
Conference papers

Lemmas on Partial Observation, with Application to Phantom Games

Fabien Teytaud 1, 2 Olivier Teytaud 1, 2
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : Solving games is usual in the fully observable case. The partially observable case is much more difficult; whenever the number of strategies is finite (which is not necessarily the case, even when the state space is finite), the main tool for the exact solving is the construction of the full matrix game and its solving by linear programming. We here propose tools for approximating the value of partially observable games. The lemmas are relatively general, and we apply them for deriving rigorous bounds on the Nash equilibrium of phantom-tic-tac-toe and phantom-Go.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Fabien Teytaud <>
Submitted on : Thursday, September 22, 2011 - 4:37:11 PM
Last modification on : Thursday, July 8, 2021 - 3:48:31 AM
Long-term archiving on: : Tuesday, November 13, 2012 - 2:20:25 PM


Files produced by the author(s)


  • HAL Id : inria-00625794, version 1



Fabien Teytaud, Olivier Teytaud. Lemmas on Partial Observation, with Application to Phantom Games. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. ⟨inria-00625794⟩



Record views


Files downloads