Stationary and convergent strategies in Choquet games

From MaRDI portal
Publication:3568396

DOI10.4064/FM209-1-5zbMATH Open1200.91054arXiv0907.4126OpenAlexW3106504419WikidataQ57951158 ScholiaQ57951158MaRDI QIDQ3568396FDOQ3568396


Authors: François G. Dorais, Carl Mummert Edit this on Wikidata


Publication date: 11 June 2010

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Abstract: If NONEMPTY has a winning strategy against EMPTY in the Choquet game on a space, the space is said to be a Choquet space. Such a winning strategy allows NONEMPTY to consider the entire finite history of previous moves before making each new move; a stationary strategy only permits NONEMPTY to consider the previous move by EMPTY. We show that NONEMPTY has a stationary winning strategy for every second countable T1 Choquet space. More generally, NONEMPTY has a stationary winning strategy for any T1 Choquet space with an open-finite basis. We also study convergent strategies for the Choquet game, proving the following results. (1) A T1 space X is the open image of a complete metric space if and only if NONEMPTY has a convergent winning strategy in the Choquet game on X. (2) A T1 space X is the compact open image of a metric space if and only if X is metacompact and NONEMPTY has a stationary convergent strategy in the Choquet game on X. (3) A T1 space X is the compact open image of a complete metric space if and only if X is metacompact and NONEMPTY has a stationary convergent winning strategy in the Choquet game on X.


Full work available at URL: https://arxiv.org/abs/0907.4126




Recommendations





Cited In (15)





This page was built for publication: Stationary and convergent strategies in Choquet games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568396)