AFTD Auto-Formalizing Theoretical Domains

picking_turn_any

def

All states a turn of agent i can lead to, whatever its ranking: the state unchanged, or any not yet allocated good of the list U added to i's bundle.

Statement

def picking_turn_any {N G : Type*} [DecidableEq N] [DecidableEq G] (U : List G) (i : N)
    (st : (N → Finset G) × Finset G) : List ((N → Finset G) × Finset G)
Source
Helper for round_robin_pne_not_ef1_three_agents_eight_goods (arXiv:2610.23686 Proposition 1): reduces a pure-Nash check over all rankings of one agent to the finitely many runs where that agent takes any available good.
Verified
19 Oct 2026
Axioms
none listed
Built on 1
  • picking_turnOne turn of a picking-sequence mechanism: the active agent i receives the first good of its reported ranking l (best first) that is not…
Used by 3
  • foldl_mem_picking_runs_anyRunning the picking sequence with an arbitrary list for agent i ends in one of the states of picking_runs_any.
  • picking_runs_anyThe final states of a picking-sequence run in which agent i may take any available good at its turns while every other agent follows its…
  • picking_turn_mem_anyWhatever ranking agent i reports, its turn leads to one of the states of picking_turn_any (when U lists every good).

Lean source view module on GitHub

/-- All states a turn of agent `i` can lead to, whatever its ranking: unchanged, or any good `g ∈ U` not yet allocated added to its bundle. -/
def picking_turn_any {N G : Type*} [DecidableEq N] [DecidableEq G] (U : List G) (i : N)
    (st : (N → Finset G) × Finset G) : List ((N → Finset G) × Finset G) :=
  st :: (U.filter (fun g => decide (g ∉ st.2))).map
    (fun g => (Function.update st.1 i (insert g (st.1 i)), insert g st.2))
See it in the graphDiscuss this resultChallenge it