Logic Seminar

Luke SerafinCornell University
Choices without Choice: answers to questions about games and economics

Tuesday, September 6, 2022 - 2:45pm
Malott 206

We study an infinite generalization of the well-known hat game, in which a line of players receive black and white hats and need to guess the colors of their own hats based on the answers of previous players and knowledge of the hat colors of the players in front of them. Optimal strategies can be constructed from either an E_0 transversal or a nonprincipal ultrafilter, and we use techniques of geometric set theory to prove that neither of these objects is necessary for the construction of an optional strategy in the hat game.