Fixed-Sum Payoff Matrix¶
Artifact — instantiates Fixed-Sum Payoff Governance
Maps participant payoffs across strategies or outcomes in a single table and verifies whether the totals remain constant, confirming the interaction is fixed-sum.
A Fixed-Sum Payoff Matrix is the formal artifact that lays out, in one table, what every participant receives under every combination of strategies or outcomes — and then checks the single property that makes the game fixed-sum: that the payoffs in each cell add up to the same total. It is the normal-form representation borrowed from game theory. Rows and columns are the players' options; each cell holds a payoff vector, one number per player; and if every cell's numbers sum to a constant, the interaction is a constant-sum game, in which one player's gain is exactly another's loss. Its defining move, distinct from any narrative account of who benefits, is that it makes the payoff structure explicit and shared, so all parties reason from the same numbers rather than from competing stories about who is really winning.
Example¶
Consider a penalty kick. The kicker can aim left or right; the goalkeeper can dive left or right. Build the matrix: when the two match, the keeper tends to save (a low payoff for the kicker, high for the keeper); when they mismatch, the kicker tends to score. Fill each cell with the kicker's scoring probability and its complement for the keeper — say 0.9 versus 0.1 on a clean mismatch, 0.3 versus 0.7 when the keeper guesses right. The two numbers in every cell sum to 1.0, and that constant total is the confirmation: this is a fixed-sum interaction, where every percentage point the kicker gains, the keeper loses. Laid out this way, the matrix shows something a shouted "it's a mind game" cannot — there is no cell where both parties do well, no cooperative escape — which is precisely why real kickers randomize. The artifact turns intuition into a checkable structure a coach and an analyst can argue over using the same figures.
How it works¶
- Enumerate each player's strategy set as the rows and columns of the table.
- Record a payoff vector in every cell — the payoff to each player under that strategy profile.
- Sum each cell's payoffs. If the total is constant across all cells, the game is fixed-sum (and zero-sum once the constant is normalized away).
- Publish the completed matrix so it is common knowledge — every party sees the identical payoffs and cannot argue from a private version.
Tuning parameters¶
- Payoff granularity — coarse ordinal ranks versus precise cardinal values. Cardinal payoffs support computation but demand data the situation may not have.
- Strategy resolution — how finely to slice each player's options. Finer matrices are more faithful but grow combinatorially.
- Normalization — whether to subtract the constant so the game reads as literally zero-sum, easing comparison across games.
- Player count — a two-by-two table versus an n-dimensional payoff array. More players make the matrix exponentially harder to build and to read.
When it helps, and when it misleads¶
Its strength is that it forces the payoff structure into the open and lets the fixed-sum claim be checked rather than asserted; it is the substrate that minimax reasoning and transfer accounting both read from. Its failure mode is that a matrix is only as honest as its payoff numbers, and the payoffs hardest to quantify — reputational, psychological, long-horizon — are exactly the ones whose omission can make a variable-sum game look zero-sum.[1] A tidy two-by-two can thereby encode a false conservation simply by leaving the enlarging moves off the table. The classic misuse is presenting such a matrix as proof the world is zero-sum. The discipline that guards against this is to treat the matrix as a model to be challenged — by the boundary audit and the framing challenge — not as ground truth.
How it implements the components¶
The matrix fills the representation side of the archetype — the components that make payoffs legible and shared:
actor_payoff_vector— each cell is a vector of every actor's payoff under that strategy profile; the matrix is nothing but these vectors tabulated and checked for a constant sum.information_symmetry_requirement— publishing the completed matrix makes all payoffs common knowledge, so every party reasons from the same figures rather than a privately held one.
It records the payoffs but does not take the worst-case view or choose a robust action — minimax_loss_view and distribution_or_contest_rule are read off it by Minimax Strategy Review. And though it resembles a table of who-gets-what, it maps *hypothetical payoffs across every strategy profile rather than recording one decision's realized winners and losers along their burden pathways — that transfer_balance_ledger is Transfer Incidence Ledger, its nearest look-alike.*
Related¶
- Instantiates: Fixed-Sum Payoff Governance — the matrix is the base artifact that represents and verifies the conserved payoff the archetype governs.
- Sibling mechanisms: Distributional Loss Review · Fixed-Pie Boundary Audit · Minimax Strategy Review · Transfer Incidence Ledger · Zero-Sum Framing Challenge · Contest Rulebook
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: Fixed-Sum Payoff Matrix operates as a computation, comparison, model, or analytic representation used to infer, estimate, or choose because it maps participant payoffs across strategies or outcomes in a single table and verifies whether the totals remain constant, confirming the interaction is fixed-sum.
Independent corroboration: The frozen evidence defines Fixed-Sum Payoff Matrix as 'Maps participant payoffs across strategies or outcomes in a single table and verifies whether the totals remain constant, confirming the interaction is fixed-sum', so its operative form is Analysis, Modeling & Optimization.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Economics & Finance
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Universal
Rationale: Payoff matrices and constant-sum games were formalized in game theory at the economics-strategy boundary.
Related originating lineages:
- Mathematics — Mathematical game theory supplies matrix representation and equilibrium analysis.
- Operations Research — Decision analysis and strategic optimization apply payoff matrices operationally.
Review resolution: Both reviewers agree that economics_finance is primary. I retain mathematics, operations_research only as formative origin lineage(s), without treating every later application as an origin. cross_disciplinary_synthesis is appropriate because the exact artifact combines contributions from multiple professional lineages. Reach is universal as a separate applicability judgment: it does not widen or narrow the recorded provenance. Encyclopedia synthesis is false because the artifact is already established enough that encyclopedia-specific synthesis is not required. The secondary differences are reconciled with no unresolved primary-provenance ambiguity.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
A payoff matrix and a transfer ledger are easy to confuse because both tabulate gains and losses, but they answer different questions in different tenses. The matrix is ex ante and hypothetical — "what would each player get under each strategy?" — while the ledger is ex post and actual — "who did gain, who did lose, and through what pathway?" Building one when the decision needed the other is a common early mistake.
References¶
[1] In a constant-sum game the players' payoffs sum to the same total in every outcome, so it is strategically equivalent to a zero-sum game once the constant is subtracted. John von Neumann's minimax theorem (1928) established that every finite two-person zero-sum game has a well-defined value and optimal, possibly randomized, strategies — the theoretical reason a fixed-sum matrix is worth building in the first place. withdrawn registry ↩