Open Access
2003-2004 An infinite game on groups.
Liljana Babinkostova , Marion Scheepers
Author Affiliations +
Real Anal. Exchange 29(2): 739-754 (2003-2004).


We consider an infinite game on a group $G$, defined relative to a subset $A$ of $G$. The game is denoted $\mathsf{G}(G,A)$. The finite version of the game, introduced in [1], was inspired by an attack on the RSA crypto-system as used in an implementation of SSL. Besides identifying circumstances under which player TWO does not have a winning strategy, we show for the topological group of real numbers that if $C$ is a set of real numbers having a selection property (*) introduced by Gerlits and Nagy, then for any interval $J$ of positive length, TWO has a winning strategy in the game $\mathsf{G}(\mathbb{R},J \cup C)$


Download Citation

Liljana Babinkostova . Marion Scheepers . "An infinite game on groups.." Real Anal. Exchange 29 (2) 739 - 754, 2003-2004.


Published: 2003-2004
First available in Project Euclid: 7 June 2006

zbMATH: 1065.03026
MathSciNet: MR2083809

Primary: 03E17 , 20F99 , 91A05

Keywords: game , group , Selection principle , winning strategy

Rights: Copyright © 2003 Michigan State University Press

Vol.29 • No. 2 • 2003-2004
Back to Top