The Monty Hall Problem: Switching is Forced by the Strategic Thinking

2011/03/20 by Alexander Gnedin, Gnedin, Alexander
Computer Science · Mathematics · #91A05 #97A20 #Algorithms and Data Compression #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #History and Overview (math.HO) #Probability and Statistical Research

paper · pdf · doi:10.48550/arxiv.1103.3890

openalex publication_date 2011/03/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Game versions of the Monty Hall Problem are discussed. The focus is on the principle of eliminating the dominated strategies, both in the zero-sum and noncooperative formulations.

Related

• The Monty Hall Problem in the Game Theory Class
• The Doors
• The rationality of irrationality in the Monty Hall problem
• The Monty Hall problem revisited
• Monty Hall problem revisited once more