BONUS! Maximizing Surprise

07/17/2021
by   Zhihuan Huang, et al.
0

Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with n rounds, we aim to derive the optimal bonus size to maximize the audience's overall expected surprise (as defined in [7]). We model the audience's prior belief over the two players' ability levels as a beta distribution. Using a novel analysis that clarifies and simplifies the computation, we find that the optimal bonus depends greatly upon the prior belief and obtain solutions of various forms for both the case of a finite number of rounds and the asymptotic case. In an interesting special case, we show that the optimal bonus approximately and asymptotically equals to the "expected lead", the number of points the weaker player will need to come back in expectation. Moreover, we observe that priors with a higher skewness lead to a higher optimal bonus size, and in the symmetric case, priors with a higher uncertainty also lead to a higher optimal bonus size. This matches our intuition since a highly asymmetric prior leads to a high "expected lead", and a highly uncertain symmetric prior often leads to a lopsided game, which again benefits from a larger bonus.

READ FULL TEXT

page 5

page 16

research
02/10/2020

On the effect of symmetry requirement for rendezvous on the complete graph

We consider a classic rendezvous game where two players try to meet each...
research
08/22/2020

Solving the Three-Player-Game

In this paper we solve the three-player-game question. A three-player-ga...
research
09/18/2023

How to Make Knockout Tournaments More Popular?

Given a mapping from a set of players to the leaves of a complete binary...
research
02/21/2023

The Swiss Gambit

In each round of a Swiss-system tournament, players of similar score are...
research
03/19/2023

Sequential Persuasion Using Limited Experiments

Bayesian persuasion and its derived information design problem has been ...
research
07/19/2020

Exploitation of Multiple Replenishing Resources with Uncertainty

We consider an optimization problem in which a (single) bat aims to expl...
research
05/10/2022

Optimal grading contests

We study the contest design problem in an incomplete information environ...

Please sign up or login with your details

Forgot password? Click here to reset