pick_game_root_allocation
def
The root allocation from the continuation assigns its root bundle to agent 0 and all remaining objects to agent 1.
Statement
noncomputable def pick_game_root_allocation {n : ℕ} (F : List (Fin n) → Finset (Fin n)) (i : Fin 2) : 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_ef1For any two agents with positive additive values that are distinct across the items for each agent, every subgame-perfect continuation…
- pick_game_root_allocation_partitionFor any root continuation bundle, the two-agent root allocation gives disjoint bundles whose union is the whole item set.
- 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…
- 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_root_allocation {n : ℕ} (F : List (Fin n) → Finset (Fin n)) (i : Fin 2) : Finset (Fin n) := if i = 0 then F [] else Finset.univ \ F []