AFTD Auto-Formalizing Theoretical Domains

pick_game_move_zero

def

For a history and a legal next choice, the resulting agent-0 continuation bundle consists of the selected object together with the subsequent continuation if agent 0 moves, and otherwise is the subsequent continuation.

Statement

noncomputable def pick_game_move_zero {n : ℕ} (s : List (Fin 2))
    (F : List (Fin n) → Finset (Fin n)) (h : List (Fin n)) (x : Fin n) : Finset (Fin n)
Source
Operational finite perfect-information picking game for arXiv:2611.09685 Section 7, OP-1323.
Verified
09 Nov 2026
Axioms
none listed
Used by 5
  • block_snake_two_agent_spe_nel_ef1_three_itemsFor two agents with positive additive values that are distinct across three items for each agent, every subgame-perfect continuation…
  • 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…
  • pick_game_is_speAn outcome-continuation function is subgame-perfect for a fixed finite two-agent picking order if, after every duplicate-free history, its…
  • round_robin_five_item_spe_not_nelFor two agents with identical item values 16, 8, 4, 2 and 1 and the round-robin order 0,1,0,1,0, there is a subgame-perfect continuation…
  • picking_two_agent_spe_eq_reverse_crossoutIn a finite two-agent sequential picking game with any fixed order and positive additive item values distinct for each agent, every…

Lean source view module on GitHub

noncomputable def pick_game_move_zero {n : ℕ} (s : List (Fin 2))
    (F : List (Fin n) → Finset (Fin n)) (h : List (Fin n)) (x : Fin n) : Finset (Fin n) := if s.getD h.length 0 = 0 then insert x (F (h ++ [x])) else F (h ++ [x])
See it in the graphDiscuss this resultChallenge it