Lemmas on partial observation, with application to phantom games

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 243-249

  Teytaud, F ^a   Teytaud, O ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX GAME; NASH EQUILIBRIUM; PARTIAL OBSERVATION; STATE SPACE;

ARTIFICIAL INTELLIGENCE;

EID: 80054048141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6032013     Document Type: Conference Paper

References (12)

1. Audibert, J.-Y. and Bubeck, S. (2009). Minimax policies for adversarial and stochastic bandits. In 22th annual conference on learning theory, Montreal.
2. Boissac, F. and Cazenave, T. (2006). De nouvelles heuristiques de recherche appliques la rsolution d'Atarigo. In Intelligence Artificielle et Jeux, pages 127-141. Hermes Science Lavoisier.
3. Boutin, M. (2010). Les jeux de pions en france dans les années 1900 et leurs liens avec les jeux étrangers. linvention dun jeu singulier : lattaque. In Proceedings of BGA'2010.
4. Bouton, C. (1901-1902). Nim: A game with a complete mathematical theory. The Annals of Mathematics, 3(1/4):35-39.
5. Cazenave, T. (2006). A phantom-go program. In ACG, pages 120-125.
6. Cazenave, T. and Borsboom, J. (2007). Golois wins phantom go tournament. ICGA Journal, 30(3):165-166.
7. Grigoriadis, M. D. and Khachiyan, L. G. (1995). A sublinear-time randomized approximation algorithm for matrix games. Operations Research Letters, 18(2):53-58.
8. Kryukov, K. (2006). EGTs online.
9. Littman, M. L., Cassandra, A. R., and Kaelbling, L. P. (1995). An efficient algorithm for dynamic programming in partially observable markov decision processes. Technical Report CS95-19, Brown University, Providence, Rhode Island.
10. Parr, R. and Russell, S. (1995). Approximating optimal policies for partially observable stochastic domains. In Proceedings of the International Joint Conference on Artificial Intelligence.
11. Schaeffer, J., Burch, N., Bjornsson, Y., Kishimoto, A., Muller, M., Lake, R., Lu, P., and Sutphen, S. (2007). Checkers is solved. Science, pages 1144079+.
12. van der Werf, E., Uiterwijk, J., and van den Herik, H. (2002). Solving Ponnuki-Go on small boards. In Proceedings of 14th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC'02), pages 347-354.