ZeroSumChance.GameTree.DStrategy
defimported Lean
A's dominant strategy: at each A-node, move to whichever child has the higher value; ties go left.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def ZeroSumChance.GameTree.DStrategy : Strategy
- Defined in
- EconCSLib, `ZeroSumChance.GameTree.DStrategy`
- 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.DStrategy← ZeroSumChance.GameTree.DStrategy (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:134): 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.instInhabitedGameTreeZeroSumChance.instInhabitedGameTree
- 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.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 /-- **A's dominant strategy**: at each A-node, move to whichever child has the higher value; ties go left. -/ def ZeroSumChance.GameTree.DStrategy : Strategy := fun L R => if L.value < R.value then .r else .l