Reseña: Algorithms in games evolving in time: Winning strategies based on testing

Se ha publicado un nuevo artículo de razonamiento formalizado en Isabelle/HOL sobre la teoría de juegos, titulado Algorithms in games evolving in time: Winning strategies based on testing. Sus autores son Evgeny Dantsin, Jan-Georg Smaus y Sergei Soloviev y se presentará el 12 de agosto en el Isabelle Users Workshop 2012.

Su resumen es

We model two-player imperfect-information games evolving in time, where one player makes and tests “hypotheses” about the opponent’s strategies. We consider algorithms needed for the first player to compute a winning strategy. The main assumptions about the scenario are the following: (1) the hypotheses form a “covering”, i.e., each strategy of the second player satisfies at least one hypothesis; (2) the hypotheses can be enumerated and tested; (3) for each hypothesis, the first player has a strategy that “defeats” all of the opponent’s strategies satisfying this hypothesis.

We have modelled a significant part of the theory presented here in Isabelle/HOL.