EconCSLib.StrategicGame.IsConstantSum
defimported Lean
A two-player game is constant-sum if payoffs sum to c at every profile.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {U : Type*} in def EconCSLib.StrategicGame.IsConstantSum [Add U] (G : EconCSLib.StrategicGame (Fin 2) U) (c : U) : Prop
- Defined in
- EconCSLib, `StrategicGame.IsConstantSum`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.EconCSLib.StrategicGame.IsConstantSum← StrategicGame.IsConstantSum (EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:53): adapted
What was changed in
EconCSLib.StrategicGame.IsConstantSum--- EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:53 (StrategicGame.IsConstantSum) +++ as compiled here @@ -1,3 +1,5 @@ -/-- A two-player game is constant-sum if payoffs sum to `c` at every profile. -/ -def IsConstantSum [Add U] (G : StrategicGame (Fin 2) U) (c : U) : Prop := +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +variable {U : Type*} in +def EconCSLib.StrategicGame.IsConstantSum [Add U] (G : EconCSLib.StrategicGame (Fin 2) U) (c : U) : Prop := ∀ σ : G.Profile, G.payoff σ 0 + G.payoff σ 1 = c - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- EconCSLib.StrategicGame.ProfileThe type of strategy profiles for game
G: each player picks a strategy. This is a dependent function∀ i, G.strategy i. The profile… - EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and a…
- EconCSLib.StrategicGame.ProfileThe type of strategy profiles for game
- Used by 7
- EconCSLib.StrategicGame.IsConstantSum.welfare_eqTwo-player constant-sum games have constant social welfare at every profile.
- EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eq_p1In a constant-sum game, all Nash equilibria yield the same payoff for player 1.
- EconCSLib.StrategicGame.isZeroSum_iff_isConstantSum_zero
IsZeroSum GandIsConstantSum G 0are the same proposition. - EconCSLib.StrategicGame.IsConstantSum.negIn a constant-sum game, player 1's payoff is
cminus player 0's.AddCommGroupis needed (not justAddGroup): the RHS usesSub,… - EconCSLib.StrategicGame.IsZeroSum.toIsConstantSumA zero-sum game is a constant-sum game with constant
0. - EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eqIn a constant-sum game, all Nash equilibria yield the same payoff for player 0. [MSZ Theorem 4.44–4.45]
- EconCSLib.StrategicGame.IsConstantSum.zero_isZeroSumA constant-sum game whose constant is
0is zero-sum.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {U : Type*} in /-- A two-player game is constant-sum if payoffs sum to `c` at every profile. -/ def EconCSLib.StrategicGame.IsConstantSum [Add U] (G : EconCSLib.StrategicGame (Fin 2) U) (c : U) : Prop := ∀ σ : G.Profile, G.payoff σ 0 + G.payoff σ 1 = c