Zero-sum game
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The value from both sides
Two choosers move at the same instant, and each asks the cautious question — how much can be guaranteed, whatever the other does. With pure choices the two answers are usually different numbers; allow a probability and they are forced to be the same one.
A signal both can see
Two choosers who randomise privately can reach a set of outcomes that is smaller, and worse, than the set they reach when a device draws one cell and whispers each of them their half of it. Nothing is enforced and nobody is bound, and the arrangement is stable anyway.
Named alongside it
The objects these essays reach for when they reach for this one.
Correlated equilibriumLinear programMixed strategyNash equilibriumBest replyConditional probabilityConvexityDominant strategyDualityExhaustive searchExistence proofMinimax