2014/04/01 by Mario Benevides, Isaque Lima, Rafael Nader +1
Computer Science · #cs.GT #cs.IR #cs.LG
paper · pdf · doi:10.4204/eptcs.144.6
published as EPTCS 144, 2014, pp. 73-84 · In Proceedings DCM 2013, arXiv:1403.7685
arxiv created 2014/04/01 · arxiv updated 2014/04/02
In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase the player's odds. To achieve that we use Markov games combined with hidden Markov model. We discuss a hypothetical example of a tennis game whose solution can be applied to any game with similar characteristics.