ZeroSumChance.GameTree.outcome
defimported Lean
The realized payoff for player A when A plays SA and B plays SB. Nature's moves are resolved by their fixed probabilities.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def ZeroSumChance.GameTree.outcome (SA SB : Strategy) : GameTree → ℚ
- Defined in
- EconCSLib, `ZeroSumChance.GameTree.outcome`
- 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.GameTree.outcome← ZeroSumChance.GameTree.outcome (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:142): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- 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.SelectA binary choice:
l= left branch,r= right branch. - ZeroSumChance.PlayerThe two players in a zero-sum game: A is the maximizer, B is the minimizer.
- ZeroSumChance.instInhabitedGameTreeZeroSumChance.instInhabitedGameTree
- ZeroSumChance.GameTree.StrategyA pure strategy is a function that, given a player's decision node, selects one of the two branches.…
- ZeroSumChance.GameTreeA finite binary game tree for a 2-player zero-sum game with Nature. *
- Used by 1
- ZeroSumChance.GameTree.value_propSoundness of
DStrategy: the backward-induction value is a lower bound on the outcome A achieves by followingDStrategy, regardless…
- ZeroSumChance.GameTree.value_propSoundness of
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- The realized payoff for player A when A plays `SA` and B plays `SB`. Nature's moves are resolved by their fixed probabilities. -/ def ZeroSumChance.GameTree.outcome (SA SB : Strategy) : GameTree → ℚ | Leaf r => r | Pnode p L R => match p with | .A => match SA L R with | .l => outcome SA SB L | .r => outcome SA SB R | .B => match SB L R with | .l => outcome SA SB L | .r => outcome SA SB R | Nnode prob L R => prob * outcome SA SB L + (1 - prob) * outcome SA SB R