Schmidt's Game and Vitali Sets
James Atchley, Lior Fishman, Stephen Jackson, Daozheng Liu, Emily Yao

TL;DR
This paper explores the winning properties of Vitali sets in Schmidt's game, demonstrating that some Vitali sets can be winning for certain parameters while others cannot, and compares these properties with other pathological sets.
Contribution
It establishes conditions under which Vitali sets are winning or losing in Schmidt's game, revealing nuanced behaviors not previously documented.
Findings
Certain Vitali sets are $(rac{1}{2}, rac{1}{2})$-winning.
All Vitali sets are $(rac{1}{3}, rac{1}{3})$-losing.
Different pathological sets exhibit distinct winning properties.
Abstract
While many types of non-measurable sets are never -winning in the sense of Schmidt's game, we show that this is not the case for certain Vitali sets. Our main theorems show that for certain values of one can construct a Vitali set which is -winning, while for other values of every Vitali set is -losing. We also investigate the -Schmidt game for various other types of pathological sets, highlighting their differences from Vitali sets.
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
TopicsAdvanced Topology and Set Theory · Complexity and Algorithms in Graphs · Advanced Graph Theory Research
