Graph explorer

The Doors

We emphasize the dominance in the Monty Hall problem, both in the classical scenario and its multi-door generalization. This is used to show optimality of the class of always-switching strategies for nonuniform allocation of the prize and arbitrary door-revealing mechanism in the event of match.

3 nodes2 linksoverview mapThe Doors
3 nodes2 links
The Doors3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWThe Doorspreprint / 2011AAlexander GnedinResearcherTmath.HO497 works
PaperSignal 102 links

The Doors

preprint / 2011

Open