AFTD Auto-Formalizing Theoretical Domains

pick_game_is_spe

def

An outcome-continuation function is subgame-perfect for a fixed finite two-agent picking order if, after every duplicate-free history, its agent-0 continuation is contained in the available objects, and either there are none and it is empty, or an available object induces that continuation and gives the current picker at least as much additive utility as every alternative followed by the specified continuation. The order has one turn per object. Histories include all off-path subgames.

Statement

noncomputable def pick_game_is_spe {n : ℕ} (u : Fin 2 → Fin n → ℝ)
    (s : List (Fin 2)) (F : List (Fin n) → Finset (Fin n)) : Prop
Source
Operational finite perfect-information picking game for arXiv:2611.09685 Section 7, OP-1323.
Verified
09 Nov 2026
Axioms
none listed
Built on 2
  • pick_game_move_zeroFor a history and a legal next choice, the resulting agent-0 continuation bundle consists of the selected object together with the…
  • pick_game_move_payoffThe mover’s additive payoff from the current remaining objects if the specified item is chosen, followed by the given continuations: agent…
Used by 4

Lean source view module on GitHub

noncomputable def pick_game_is_spe {n : ℕ} (u : Fin 2 → Fin n → ℝ)
    (s : List (Fin 2)) (F : List (Fin n) → Finset (Fin n)) : Prop := s.length = n ∧ ∀ h : List (Fin n), h.Nodup →
    let R := Finset.univ \ h.toFinset
    F h ⊆ R ∧
    if R.Nonempty then
      ∃ x ∈ R, F h = pick_game_move_zero s F h x ∧
        ∀ y ∈ R, pick_game_move_payoff u s F h y ≤ pick_game_move_payoff u s F h x
    else F h = ∅
See it in the graphDiscuss this resultChallenge it