Infinite games with uncertain moves
Computer Science and Game Theory
2013-03-05 v1 Logic in Computer Science
Abstract
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to the next higher level.
Keywords
Cite
@article{arxiv.1303.0788,
title = {Infinite games with uncertain moves},
author = {Nicholas Asher and Soumya Paul},
journal= {arXiv preprint arXiv:1303.0788},
year = {2013}
}
Comments
In Proceedings SR 2013, arXiv:1303.0071