AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.BehaviorStrategy

defimported Lean

A behavior strategy for player i: at every nonterminal state controlled by i, choose a probability distribution over the actions available there. This is a state-based primitive. A later imperfect-information layer can impose the usual information-set consistency condition by requiring equal distributions across states in the same information set. The nonterminal premise prevents a semantically ignored terminal mover label from creating an impossible simplex coordinate over an empty action type.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
def ExtensiveGame.BehaviorStrategy (G : ExtensiveGame iota U) (i : iota)
    [(s : G.State) -> Fintype (G.Action s)] : Type _
Defined in
EconCSLib, `ExtensiveGame.BehaviorStrategy`
Lean proof
By xbei, Lazyfill (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.
Verified
08 Oct 2026
Axioms
none listed
Built on 8
Used by 15

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
/-- A behavior strategy for player `i`: at every nonterminal state controlled by `i`, choose a probability distribution over the actions available there. This is a state-based primitive. A later imperfect-information layer can impose the usual information-set consistency condition by requiring equal distributions across states in the same information set. The nonterminal premise prevents a semantically ignored terminal mover label from creating an impossible simplex coordinate over an empty action type. -/
def ExtensiveGame.BehaviorStrategy (G : ExtensiveGame iota U) (i : iota)
    [(s : G.State) -> Fintype (G.Action s)] : Type _ :=
  (s : G.State) -> G.mover s = some i ->
    ¬ G.isTerminal s -> stdSimplex Real (G.Action s)
See it in the graphDiscuss this resultChallenge it