AFTD Auto-Formalizing Theoretical Domains

pick_game_move_payoff

def

The mover’s additive payoff from the current remaining objects if the specified item is chosen, followed by the given continuations: agent 0 receives its candidate bundle, and agent 1 receives the remaining items outside it.

Statement

noncomputable def pick_game_move_payoff {n : ℕ} (u : Fin 2 → Fin n → ℝ)
    (s : List (Fin 2)) (F : List (Fin n) → Finset (Fin n))
    (h : List (Fin n)) (x : Fin n) : ℝ
Source
Operational finite perfect-information picking game for arXiv:2611.09685 Section 7, OP-1323.
Verified
09 Nov 2026
Axioms
none listed
Built on 1
  • 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…
Used by 4
  • 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_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_payoff {n : ℕ} (u : Fin 2 → Fin n → ℝ)
    (s : List (Fin 2)) (F : List (Fin n) → Finset (Fin n))
    (h : List (Fin n)) (x : Fin n) : ℝ := let p := s.getD h.length 0
  let R := Finset.univ \ h.toFinset
  let A := pick_game_move_zero s F h x
  ∑ z ∈ (if p = 0 then A else R \ A), u p z
See it in the graphDiscuss this resultChallenge it