The surprise exam paradox has attracted the attention of prominent logicians, mathematicians and philosophers for decades. Although the paradox itself has been resolved at least since Quine (1953), some aspects of it are still being discussed. In this paper we propose, following Sober (1998), to translate the paradox into the language of game theory to clarify these aspects. Our main conclusions are that a much simpler game-theoretic analysis of the paradox is possible, which solves most of the puzzles related to it, and that this way of analysing the paradox can also throw light on our comprehension of the pragmatics of linguistic communication.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.