ZeroSumChance.Player
inductiveimported Lean
The two players in a zero-sum game: A is the maximizer, B is the minimizer.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in inductive ZeroSumChance.Player
- Defined in
- EconCSLib, `ZeroSumChance.Player`
- 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.ZeroSumChance.Player← ZeroSumChance.Player (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:70): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 6
- ZeroSumChance.GameTree.size_posEvery game tree has positive size.
- ZeroSumChance.GameTree.outcomeThe realized payoff for player A when A plays
SAand B playsSB. Nature's moves are resolved by their fixed probabilities. - ZeroSumChance.GameTree.value_propSoundness of
DStrategy: the backward-induction value is a lower bound on the outcome A achieves by followingDStrategy, regardless… - ZeroSumChance.GameTreeA finite binary game tree for a 2-player zero-sum game with Nature. *
Leaf val— terminal node;valis A's payoff (B gets-val). *… - ZeroSumChance.GameTree.valueThe backward-induction value of the game tree for player A. * A-node: A maximizes, so we take the max of both children's values. * B-node:…
- ZeroSumChance.GameTree.sizeStructural size of a game tree (used internally for well-founded reasoning).
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- The two players in a zero-sum game: A is the maximizer, B is the minimizer. -/ inductive ZeroSumChance.Player | A : Player -- Alice, maximizer | B : Player -- Bob, minimizer deriving Repr, DecidableEq