The no-$\beta$ McMullen game and the perfect set property
Logan Crone, Lior Fishman, Stephen Jackson

TL;DR
This paper studies a variant of McMullen's game without the parameter $eta$, revealing its connection to the perfect set property and providing geometric and logical insights into the structure of uncountable sets in Euclidean spaces.
Contribution
It introduces the no-$eta$ McMullen game and establishes its equivalence to the perfect set game for certain convex sets, linking game theory, geometry, and logic.
Findings
Player I wins iff A contains a perfect set.
Player II wins iff A is countable.
Results apply to strictly convex sets, polytopes, and convex sets in $\
Abstract
Given a target set and a real number , McMullen introduced the notion of being an absolutely -winning set. This involves a two player game which we call the -McMullen game. We consider the version of this game in which the parameter is removed, which we call the no- McMullen game. More generally, we consider the game with respect to arbitrary norms on , and even more generally with respect to general convex sets. We show that for strictly convex sets in , polytopes in , and general convex sets in , that player wins the no- McMullen game iff contains a perfect set and player wins iff is countable. So, the no- McMullen game is equivalent to the perfect set game for in these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Logic, Reasoning, and Knowledge · Economic theories and models
