Surprise Maximization

DOI10.2307/2589347MaRDI QIDQ2757487zbMATH OpenOpenAlexFDO

Authors David Borwein, Jonathan M. Borwein, Pierre Maréchal

Publication date 26 November 2001

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/98b9254b2b164ce3d6fc0cb6f66cce43a4308ba3

zbMATH Keywords

hanging paradoxinequalitiesinformationoptimization

Mathematics Subject Classification ID

Recreational mathematics (00A08) Probability and inductive logic (03B48) Applications of mathematical programming (90C90)

Review text

Motivated by the well-known Surprise Examination or Unexpected Hanging Paradox (see e.g. \url{http://front.math.ucdavis.edu/search/author:Chow+and+Timothy}) the authors of this enjoyable paper examine and solve an optimization problem based upon an information theoretic avoidance of the Paradox. They build an entropic formulation of the Paradox and show how to apply the theory of convex constrained optimization, probability theory, classical inequalities and the Kuhn-Tucker Theorem.

Recommendations

• The Surprise Examination or Unexpected Hanging Paradox
• To give a surprise exam, use game theory
• scientific article; zbMATH DE number 4041858
• How to expect a surprising exam
• Once more on the unexpected examination

Cited in

(3)

• How to expect a surprising exam
• A Letter From the Editor: Jonathan M. Borwein (1951–2016)
• Taming surprises

This page was built for publication: Surprise Maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757487)