AFTD Auto-Formalizing Theoretical Domains

GameTree.PlayerStrategy

defimported Lean

A single player's pure strategy in the normal form of a GameTree: a complete contingent plan choosing a child at every possible node.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
variable [DecidableEq N] in
def GameTree.PlayerStrategy (N U : Type*) : Type _
Defined in
EconCSLib, `GameTree.PlayerStrategy`
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 1
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
variable [DecidableEq N] in
/-- A single player's pure strategy in the normal form of a `GameTree`: a complete contingent plan choosing a child at every possible node. -/
def GameTree.PlayerStrategy (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