AFTD Auto-Formalizing Theoretical Domains

Examples.ImperfectInformation.tiny

defimported Lean

A tiny imperfect-information game where player 1 cannot distinguish two singleton-action states reached after player 0's root choice.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def Examples.ImperfectInformation.tiny : FiniteImperfectGame Player ℤ
Defined in
EconCSLib, `Examples.ImperfectInformation.tiny`
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 7
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A tiny imperfect-information game where player 1 cannot distinguish two singleton-action states reached after player 0's root choice. -/
def Examples.ImperfectInformation.tiny : FiniteImperfectGame Player ℤ where
  State := State
  InfoSet := Info
  Action
    | .root => RootAction
    | .left => P1Action
    | .right => P1Action
    | .stop => PEmpty
  next
    | .root, RootAction.L => .left
    | .root, RootAction.R => .right
    | .left, P1Action.Stop => .stop
    | .right, P1Action.Stop => .stop
  init := .root
  mover
    | .root => some .P0
    | .left => some .P1
    | .right => some .P1
    | .stop => none
  info
    | .left => some .hiddenChoice
    | .right => some .hiddenChoice
    | _ => none
  payoff _ _ := 0
See it in the graphDiscuss this resultChallenge it