is_picking_sequence_pne
def
A profile of reported strict rankings is a pure Nash equilibrium of the picking-sequence mechanism if no agent can obtain a bundle of strictly higher true value by unilaterally changing its reported ranking.
Statement
def is_picking_sequence_pne {N G : Type*} [DecidableEq N] [DecidableEq G] {m : ℕ} (v : SocialChoice.FairDivision.Indivisible.Valuation N G) (seq : List N) (rank : N → Fin m ≃ G) : Prop
- Defined in
- arXiv:2610.23686 (Revisiting the Fairness of Pure Nash Equilibria of Round-Robin), Definition 3; arXiv:2610.23040 Definition 2.3
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Built on 2
- picking_sequence_outcomeThe allocation returned by the picking-sequence mechanism PS_π: agents act in the order seq, and at each turn the active agent takes its…
- SocialChoice.FairDivision.Indivisible.ValuationAn abstract valuation assigns a real value to each agent-bundle pair.
val i Sis the value agentiassigns to bundleS. Lives in…
- Used by 13
- 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…
- is_guaranteed_round_robin_ef1_factorA factor α is guaranteed for n agents under Round-Robin if for every number of goods m, every nonnegative additive valuation profile w,…
- is_guaranteed_sequence_ef1_factorA factor α is guaranteed for a picking sequence mechanism seq with n agents if for every nonnegative additive valuation profile and every…
- picking_sequence_alpha_nil_eq_zeroFor the empty picking sequence every EF1 factor alpha is guaranteed (all bundles are empty), so picking_sequence_alpha, defined as a real…
- round_robin_pne_ef1_pair_of_count_le_twoIn a pure Nash equilibrium of Round-Robin (nonnegative additive valuations), every agent i is EF1 towards every other agent j that appears…
- round_robin_three_agents_seven_goods_pne_ef1With three agents and seven goods, every pure Nash equilibrium of Round-Robin (nonnegative additive valuations) is EF1; so the eight-good…
- not_is_guaranteed_round_robin_ef1_factor_three_of_three_quarters_ltFor three agents, no factor strictly greater than 3/4 is guaranteed for Round-Robin pure Nash equilibria.
- round_robin_pne_ef1_of_card_le_two_mulWith n agents and at most 2n goods (every agent picks at most twice), every pure Nash equilibrium of Round-Robin, for nonnegative additive…
- round_robin_pne_envy_zero_ef1_of_deviation_certificateIf the deviation certificate of round_robin_two_mul_add_one_deviation_certificate holds for agent i ≠ 0, then at a pure Nash equilibrium…
- recursively_balanced_alpha_le_round_robin_universal_alphaThe universal EF1 approximation factor for recursively balanced sequences recursively_balanced_alpha is at most the universal factor for…
- round_robin_pne_ef1_of_card_le_two_mul_add_oneWith n agents and at most 2n + 1 goods, every pure Nash equilibrium of Round-Robin (nonnegative additive valuations) is EF1. For three…
- 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…
- round_robin_pne_envy_zero_ef1_of_two_mul_add_oneWith n agents and 2n + 1 goods, in every pure Nash equilibrium of Round-Robin (nonnegative additive valuations) every agent i ≠ 0 is EF1…
Lean source view module on GitHub
/-- A report profile is a pure Nash equilibrium of the picking-sequence mechanism if no agent can obtain a bundle of strictly higher true value `v` by unilaterally changing its reported strict ranking. -/ def is_picking_sequence_pne {N G : Type*} [DecidableEq N] [DecidableEq G] {m : ℕ} (v : SocialChoice.FairDivision.Indivisible.Valuation N G) (seq : List N) (rank : N → Fin m ≃ G) : Prop := ∀ (i : N) (r : Fin m ≃ G), v.val i (picking_sequence_outcome seq (Function.update rank i r) i) ≤ v.val i (picking_sequence_outcome seq rank i)