Countably Infinite Hats - Quant Trader Interview Question
Difficulty: Hard
Category: Market Microstructure
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: logic, probability, axiom-of-choice, game-theory
Problem Description
An infinite number of traders, numbered $1, 2, 3, ...$, are participating in a game. Each trader is wearing a hat that is either red or blue. Each trader can see the hats of all other traders, but not their own. Simultaneously, each trader must guess the color of their own hat. They win the game if only a finite number of traders guess incorrectly.
Assuming the Axiom of Choice, can the traders devise a strategy to ensure that they win the game? If so, what's the core idea behind the strategy and
Practice this hard trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.