picking_runs_any
def
The 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 ranking.
Statement
def picking_runs_any {N G : Type*} [DecidableEq N] [DecidableEq G] (U : List G) (i : N) (lists : N → List G) : List N → (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 2
- 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…
- picking_turn_anyAll 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…
- Used by 4
- round_robin_three_agents_pne_not_alpha_ef1_of_three_quarters_ltWith three agents and eight goods, there is an instance with nonnegative additive valuations and a pure Nash equilibrium of Round-Robin…
- picking_sequence_outcome_update_memWhatever ranking r agent i reports, its bundle is the bundle of agent i in one of the runs of picking_runs_any: a finite set of candidate…
- 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.
- round_robin_pne_not_ef1_three_agents_eight_goodsThere is an instance with 3 agents, 8 goods and strictly positive additive valuations, and a pure Nash equilibrium of the Round-Robin…
Lean source view module on GitHub
/-- The states reachable when agent `i` may pick any available good at its turns and every other agent follows its ranking. -/ def picking_runs_any {N G : Type*} [DecidableEq N] [DecidableEq G] (U : List G) (i : N) (lists : N → List G) : List N → (N → Finset G) × Finset G → List ((N → Finset G) × Finset G) | [], st => [st] | a :: seq, st => if a = i then (picking_turn_any U i st).flatMap (picking_runs_any U i lists seq) else picking_runs_any U i lists seq (picking_turn (lists a) a st)