picking_reverse_crossout_valid
def
A reverse crossout sequence visits every item once and, at every reversed turn, selects an available item of minimum value for the other agent. The original picking order has exactly one turn per item.
Statement
noncomputable def picking_reverse_crossout_valid {n : ℕ} (u : Fin 2 → Fin n → ℝ) (s : List (Fin 2)) (π : Fin n → Fin n) : Prop
- 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 4
- 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…
- picking_reverse_crossout_existsFor any finite number of items, any two real-valued item functions, and any picking sequence of matching length, there is a valid reverse…
- 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_valid {n : ℕ} (u : Fin 2 → Fin n → ℝ) (s : List (Fin 2)) (π : Fin n → Fin n) : Prop := s.length = n ∧ Function.Bijective π ∧ ∀ t j : Fin n, t < j → u (if s.reverse.getD t.val 0 = 0 then 1 else 0) (π t) ≤ u (if s.reverse.getD t.val 0 = 0 then 1 else 0) (π j)