AFTD Auto-Formalizing Theoretical Domains

GameTree

inductiveimported Lean

A finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. * Node mover head tail — a decision node owned by mover, with non-empty children head :: tail. Finiteness is built into the inductive type; non-emptiness of children is built into the Node constructor via head + tail.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
inductive GameTree (N : Type*) (U : Type*) : Type _
Defined in
EconCSLib, `GameTree`
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
Used by 82

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A finite extensive-form game of perfect information, without chance. * `Leaf payoff` — a terminal state with a payoff vector `N → U`. * `Node mover head tail` — a decision node owned by `mover`, with non-empty children `head :: tail`. Finiteness is built into the inductive type; non-emptiness of children is built into the `Node` constructor via `head + tail`. -/
inductive GameTree (N : Type*) (U : Type*) : Type _ | Leaf (payoff : N → U) : GameTree N U
  | Node (mover : N) (head : GameTree N U) (tail : List (GameTree N U)) :
      GameTree N U
See it in the graphDiscuss this resultChallenge it