FiniteImperfectGame.PureStrategy
defimported Lean
A pure strategy chooses one abstract action for each player and information set. The action type is indexed by a representative state for that information set. For a concrete state s, actionAt below specializes this choice at s, so choices are constant on information sets by construction at the API boundary.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : FiniteImperfectGame N U) in def FiniteImperfectGame.PureStrategy (i : N) : Type _
- Defined in
- EconCSLib, `FiniteImperfectGame.PureStrategy`
- 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.FiniteImperfectGame.PureStrategy← FiniteImperfectGame.PureStrategy (EconCSLib/GameTheory/ExtensiveGame/ImperfectInformation.lean:101): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- FiniteImperfectGameFinite imperfect-information extensive game data.
info s = nonemeans the state is not in a strategic information set, typically because…
- FiniteImperfectGameFinite imperfect-information extensive game data.
- Used by 3
- FiniteImperfectGame.actionAt_same_info_labelIf two states are in the same information set, a strategy is queried through the same information-set label at both states. This is the…
- FiniteImperfectGame.PureStrategyProfileA pure strategy profile.
- FiniteImperfectGame.PureStrategy.actionAtThe action prescribed at a concrete player-controlled state in an information set.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : FiniteImperfectGame N U) in /-- A pure strategy chooses one abstract action for each player and information set. The action type is indexed by a representative state for that information set. For a concrete state `s`, `actionAt` below specializes this choice at `s`, so choices are constant on information sets by construction at the API boundary. -/ def FiniteImperfectGame.PureStrategy (i : N) : Type _ := (k : G.InfoSet) → (s : G.State) → G.info s = some k → G.mover s = some i → G.Action s