Tensions in Practice: A predictable route in tension with a protected random choice¶
Two prepared routes and one opponent’s block
A token can take a red or blue route. One receiving setup is needed for each route that may be used. An opponent blocks exactly one route; payoff is 1 if the token avoids it and 0 otherwise. A publicly fixed red route needs one setup, but the opponent can block red. Preparing both routes and drawing privately after the block is fixed gives expected payoff 0.5 against either block. The order of information matters as much as the coin.
Prepare one predictable route
Use a single receiving setup and an announced route.
Protect against a tailored block
Hide the realized choice until the opponent has committed.
Why these aims pull against each other
The hidden draw preserves an expected payoff floor but requires both routes to be ready and a genuinely independent, unrevealed choice. A declared deterministic route exposes the very choice the opponent can counter.
Choose an arrangement to see what changes and what remains difficult.
Arrows show the order of preparation, observation and commitment. Expected payoff 0.5 is not a promise of half a token or a success on every attempt.
What this choice protects
What it costs
When it fits
Compare the arrangements
Announce one route
Prepare red and announce that red will be used. The opponent observes this commitment before choosing its block.
- What it protects
- Only one receiving setup is maintained and collaborators know the selected route.
- What it costs
- A best-responding opponent can force payoff 0 by blocking red.
- When it fits
- Fits a context where low preparation burden or advance coordination is worth accepting this explicit exposure.
Illustration note: Both routes are physically possible, but this policy commits to red. This is a deliberate exposed policy, not a claim that deterministic choice defeats the opponent.
Draw after the block
Prepare both routes. The opponent knows the fair-draw policy and fixes one block; the independent draw then selects red or blue privately.
- What it protects
- Against either committed block, half the possible draws avoid it.
- What it costs
- Two setups are maintained; choice secrecy and commitment order must be enforced. Any realized trial can still yield 0.
- When it fits
- Fits a context where protecting this expected worst-case value warrants preparation of both routes.
Illustration note: The guarantee is an expected payoff over the hidden draw. If the opponent observes the draw before choosing the block, the guarantee falls back to 0.
What this illustration does—and does not—establish
The source supplies the structural tension. This bounded example makes a particular relation inspectable; the aims, conditions and residual costs are part of the comparison.
- The binary payoff, one-block action set, fair draw and preparation rule are invented.
- This is a single-round zero-sum model. It supplies no physical security or secrecy implementation.
- It differs from assigning complementary roles with a shared draw: the relevant fact is what an opposing chooser can observe before committing.
Source entries
Minimax Strategy
The canonical tension motivates this comparison. The setting and arrangements are declared editorial illustrations, not observed findings.
Commitment Order versus Saddle-Point Existence (temporal)
The failure mode is assuming the order is irrelevant (treating maximin and minimax as interchangeable) when no saddle exists, so the player forced to commit first silently loses the gap. Diagnostic: check whether the convexity/compactness conditions hold; if not, attend to commitment order, and consider commitment devices, randomization, or information-hiding to recover the responder's advantage.
The source operation
Minimax is a decision rule for choosing under adversarial or worst-case-relevant conditions: *select the action whose worst possible outcome is the best worst possible outcome*. Equivalently, *minimize* the *maximum* loss the environment can inflict given your choice — or, in payoff form, maximize the minimum gain.