picking_reverse_crossout_allocation
def
The allocation produced by a prescribed reverse picking order and a list of distinct selected goods: an agent receives exactly the selected goods at her turns in the reversed order.
Statement
noncomputable def picking_reverse_crossout_allocation {n : ℕ} (s : List (Fin 2)) (π : Fin n → Fin n) (i : Fin 2) : Finset (Fin n)
- Source
- Reverse crossout representation of two-agent sequential picking; see https://cdn.aaai.org/ojs/8697/8697-13-12225-1-2-20201228.pdf Theorem 1.
- Verified
- 09 Nov 2026
- Axioms
- none listed
- Used by 3
- 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…
- block_snake_reverse_crossout_nel_ef1For any two real item-value functions and any valid reverse crossout sequence for the two-agent block-snake picking order, the resulting…
- 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 picking_reverse_crossout_allocation {n : ℕ} (s : List (Fin 2)) (π : Fin n → Fin n) (i : Fin 2) : Finset (Fin n) := (Finset.univ.filter fun t : Fin n => s.reverse.getD t.val 0 = i).image π