Print Email Facebook Twitter Determinacy of Infinite Games Title Determinacy of Infinite Games Author Dijkstra, Jelle (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Hart, K.P. (mentor) Kraaikamp, C. (graduation committee) Degree granting institution Delft University of Technology Programme Applied Mathematics Date 2021-08-12 Abstract This paper introduces the notion of infinite games, i.e., games in which two players take turns playing moves ad infinitum, so that player I wins if the sequence of moves is in a predetermined payoff set. Theorems are then provided about whether a player in such games can have a winning strategy. The first theorem, Gale-Stewart, shows that games with an open or closed payoff set are determined, i.e., one of the players has a winning strategy. The second theorem, Martin, shows moreover that any game with a Borel payoff set is determined. Finally, the paper presents some results that follow from these theorems, for instance that the Continuum Hypothesis holds for all Borel sets. This paper only requires knowledge of very basic set theory and will clearly define any new or otherwise unfamiliar concepts. Subject AnalysisDescriptive Set TheoryGame TheoryTreesGames To reference this document use: http://resolver.tudelft.nl/uuid:82c1bc40-6d73-4712-96ab-e8a5960d6330 Part of collection Student theses Document type bachelor thesis Rights © 2021 Jelle Dijkstra Files PDF BEP_Determinacy.pdf 344.91 KB Close viewer /islandora/object/uuid:82c1bc40-6d73-4712-96ab-e8a5960d6330/datastream/OBJ/view