Abstract
This paper proposes a game-theoretic solution of the surprise examination problem. It is argued that the game of “matching pennies” provides a useful model for the interaction of a teacher who wants her exam to be surprising and students who want to avoid being surprised. A distinction is drawn between prudential and evidential versions of the problem. In both, the teacher should not assign a probability of zero to giving the exam on the last day. This representation of the problem provides a diagnosis of where the backwards induction argument, which “proves” that no surprise exam is possible, is mistaken.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
