Maximization of a Measure of Surprise
for the Surprise Examination Problem
Pierre Marechal
ABSTRACT.
In a recent paper on the `surprise examination' or `unexpected
hanging' paradox, a new entropic formulation of this problem was
proposed. We will discuss some aspects of the optimization problems
arising from this formulation. This will provide a pleasing application
of convex programming.
(Click to return to WCOM Program.)