Prediction markets have become a prominent way of aggregating beliefs about binary future events, and their price processes are often interpreted as evolving win probabilities, or ``win-martingales.''Motivated by this perspective and recent work on Aldous'``most exciting game,''we study when a decision maker should stop observing a win-martingale and make a decision about the outcome. In particular, we allow the true outcome to be revealed at a fixed finite horizon, as in a sports game or election. Under a general terminal loss and running cost, we reduce the Bayes risk to an optimal stopping problem for the win probability process. When the win-martingale is a diffusion and its volatility separates into a deterministic time factor and a state-dependent factor, a deterministic time change transforms the problem into one for a time-homogeneous diffusion with a generally time-inhomogeneous running cost. Under explicit structural assumptions, we obtain a complete free-boundary characterization of the solution to the stopping problem in both finite and infinite horizons without discounting. We prove smooth-fit and $C^1$ regularity of the value function, $C^1$ regularity of the optimal stopping boundaries before the horizon, and derive a nonlinear integral equation that characterizes the boundaries uniquely. Taken together, these results yield a common decision-theoretic framework and solution theory for a broad class of posterior dynamics that includes the Aldous, Bass, and binary sequential-inference martingales as special cases. Our analysis requires no temporal monotonicity of the running cost and therefore accommodates highly nonmonotone stopping boundaries. In particular, we exhibit an example in which the optimal boundary has no limit as the calendar-time horizon is approached.
We study a decision-maker who explores --- dynamically choosing what to learn --- before stopping to act. We first reduce this dynamic control problem to a static one: any exploration-and-stopping strategy is equivalent to a choice of the joint distribution of the stopped state and the stopping time, subject to one inf...
A two-player zero-sum repeated game between a learner and nature whose value identity generates Bayesian updating and an exact accounting of exponential-weights regret at once is given, and supplies the comparator-class variational form that a wide class of concentration phenomena share.
This paper presents an optimization algorithm aimed at minimizing the casino's guaranteed positive earnings while simultaneously maximizing the number of players who win some amount during a given round, and analyzes its computational complexity and its stopping-multiplier statistics to give a fuller picture of how it...
We study ball-by-ball win probability (WP) for second-innings run chases in Twenty20 cricket, built as an exactly solvable Markov model: we estimate a single object, the per-ball outcome distribution over {0,...,6, wicket}, and derive WP for every game state by backward induction over the acyclic (balls, wickets, runs-...
Observed choice in a dynamic game mixes current profit with continuation value. A rival adds a second problem: the same comparison averages over the rival's equilibrium policy. Changing the primitive transition rewrites continuation technology; changing the rival's Markov policy, holding that law fixed, rewrites the mi...
Hao-Jie Liu, Zi-Han Lin· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.