AFTD Auto-Formalizing Theoretical Domains

GameTree.Strategy

defimported Lean

A pure strategy for the entire game tree: at every possible node context (mover, head, tail), specify one child (bundled with its membership proof). Note: a single Strategy covers all players. Player-i "strategies" are conceptualized as the restriction to nodes where mover = i.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] in
def GameTree.Strategy (N U : Type*) : Type _
Defined in
EconCSLib, `GameTree.Strategy`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
Used by 28

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] in
/-- A pure strategy for the entire game tree: at every possible node context `(mover, head, tail)`, specify one child (bundled with its membership proof). Note: a single `Strategy` covers all players. Player-`i` "strategies" are conceptualized as the restriction to nodes where `mover = i`. -/
def GameTree.Strategy (N U : Type*) : Type _ :=
  (m : N) → (h : GameTree N U) → (t : List (GameTree N U)) →
    { c : GameTree N U // c ∈ h :: t }
See it in the graphDiscuss this resultChallenge it