Problem of Points¶
Divide the stake of an interrupted race-to-a-target game by each player's conditional probability of eventually winning, computed from the current score and the agreed continuation model rather than from points already accumulated.
Core Idea¶
The Problem of Points asks how competitors should divide a common stake when a game that was supposed to continue until one player reached a fixed number of wins is interrupted before anyone reaches the target. The characteristic move is prospective rather than retrospective. The current score determines how many further wins each player needs; the agreed probability model determines the possible continuations; and each player's share equals the stake multiplied by that player's conditional probability of ultimately winning. The rule therefore prices the unfinished contest rather than rewarding the fraction of past points already scored.
Scope of Application¶
The Problem of Points is literal whenever an unfinished stochastic race with a precommitted winner-take-all award must be valued from its current state.
- Classical games of chance. Dividing a stake when a fair-dice, card, or coin contest ends prematurely.
- Probability education. Contrasting retrospective score ratios with prospective conditional expectation.
- Dynamic programming. Computing state values from terminal awards and one-step transition probabilities.
- Actuarial valuation. Illustrating how a contingent claim can be priced from mutually exclusive future outcomes.
- Sports and tournaments. Supplying a model-based benchmark when a race-to-target match cannot be completed, subject to governing rules.
- Game design. Checking whether cancellation and interruption clauses preserve ex ante symmetry.
- History of mathematics. Studying how combinatorial chance counts became probability-weighted valuations.
- Decision analysis. Separating model-implied expected entitlement from bargaining power, utility, and legal policy.
Clarity¶
State the target score, current score, total stake, number of players, round-outcome probabilities, dependence assumptions, and whether probabilities remain stable after interruption. Define what counts as a round and whether draws or multiway outcomes occur. If a fixed fictitious horizon is used, explain why continuations after an already decided game can be paired or ignored without changing the winner event. If recursion is used, display terminal boundary conditions and verify that every nonterminal state reduces to nearer states.
Manages Complexity¶
An interrupted game appears to leave an indeterminate bargain because the terminal winner does not exist. The abstraction converts that missing outcome into a contingent claim. First, the current score compresses relevant history when the continuation is memoryless. Second, absorbing victory states fix unquestioned terminal values. Third, transition probabilities connect the current state to those terminal values through enumeration or recursion. Finally, expectation turns mutually exclusive futures into conserved present shares.
Abstract Reasoning¶
- Recover the original terminal target and winner-take-all stake agreement. 2. Encode the interrupted score as remaining wins required by each competitor. 3. Declare the probability law for the next round and any dependence on history or state. 4. Define terminal states and assign the full stake to the corresponding winner. 5. Choose a complete fixed horizon or a one-step recursion over nonterminal states. 6.
Knowledge Transfer¶
The strict parent is Expected Value. The unfinished stake is a random terminal payoff conditional on the current score, and the proposed division assigns each player the probability-weighted average of that payoff. The transferable insight is to value an interrupted process by its future terminal outcomes rather than by a superficial fraction of work already completed. The race-to-target scoring rule, absorbing game states, historical methods, and stake-fairness interpretation are domain-specific accent.
Relationships to Other Abstractions¶
Current abstraction Problem of Points Domain-specific
Parents (1) — more general patterns this builds on
-
Problem of Points is a kind of Expected Value Prime
Expected Value is the strict parent because each player's present entitlement is the conditional average of the terminal stake over modeled continuations.
Hierarchy paths (3) — routes to 2 parentless roots
- Problem of Points → Expected Value → Aggregation → Micro Macro Linkage
- Problem of Points → Expected Value → Probability → Measure → Set and Membership
- Problem of Points → Expected Value → Probability → Measure → Aggregation → Micro Macro Linkage
Neighborhood in Abstraction Space¶
Problem of Points sits in a sparse region of the domain-specific corpus (97th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Algorithmic Procedures & Discrete Processes (14 abstractions)
Nearest neighbors
- Odds Algorithm — 0.76
- Tournament sort — 0.75
- Belief Revision — 0.75
- Lottery paradox — 0.75
- Lottery mathematics — 0.75
Computed from structural-signature embeddings · 2026-09-08