Infinite games with uncertain moves

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...

Full description

Bibliographic Details
Main Authors: Nicholas Asher, Soumya Paul
Format: Article
Language:English
Published: Open Publishing Association 2013-03-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1303.0788v1
id doaj-190e65ab8d9c460aaf23b3a2f6a85554
record_format Article
spelling doaj-190e65ab8d9c460aaf23b3a2f6a855542020-11-24T21:27:02ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-03-01112Proc. SR 2013253210.4204/EPTCS.112.7Infinite games with uncertain movesNicholas AsherSoumya PaulWe 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. http://arxiv.org/pdf/1303.0788v1
collection DOAJ
language English
format Article
sources DOAJ
author Nicholas Asher
Soumya Paul
spellingShingle Nicholas Asher
Soumya Paul
Infinite games with uncertain moves
Electronic Proceedings in Theoretical Computer Science
author_facet Nicholas Asher
Soumya Paul
author_sort Nicholas Asher
title Infinite games with uncertain moves
title_short Infinite games with uncertain moves
title_full Infinite games with uncertain moves
title_fullStr Infinite games with uncertain moves
title_full_unstemmed Infinite games with uncertain moves
title_sort infinite games with uncertain moves
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2013-03-01
description 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.
url http://arxiv.org/pdf/1303.0788v1
work_keys_str_mv AT nicholasasher infinitegameswithuncertainmoves
AT soumyapaul infinitegameswithuncertainmoves
_version_ 1725976828910239744