is_non_winner_take_all_profile
def
A bid profile is not winner-take-all if at least two distinct agents receive a positive amount of work.
Statement
def is_non_winner_take_all_profile (alloc : List ℝ → ℕ → ℝ) {n : ℕ} (β : Fin n → List ℝ) : Prop
- Defined in
- arXiv:2603.27779 v1, Sec. 6 (non-winner-take-all equilibria: the notion in its open question)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 2
- procurement_agent_allocationThe total work an agent receives: the sum of the allocations to its identities.
- procurement_others_bidsThe list of all bids of agents other than i in a profile where each agent submits a list of bids.
- Used by 3
- exists_sybil_proof_ex_post_safe_non_winner_take_all_procurementThere is a procurement mechanism that is Sybil-proof, ex-post safe for all costs at most 1, whose pure Nash equilibria (for costs at most…
- stake_share_pne_exists_and_non_winner_take_allFor n >= 2 agents with costs in [0, L] and K M >= 3 n^2 L, the stake-share mechanism has a pure Nash equilibrium, and every pure Nash…
- stake_share_pne_non_winner_take_allIn the stake-share mechanism with K, M > 0 and all costs at most L, every pure Nash equilibrium (with at least one agent) gives positive…
Lean source view module on GitHub
def is_non_winner_take_all_profile (alloc : List ℝ → ℕ → ℝ) {n : ℕ} (β : Fin n → List ℝ) : Prop := ∃ i j, i ≠ j ∧ 0 < procurement_agent_allocation alloc (β i) (procurement_others_bids β i) ∧ 0 < procurement_agent_allocation alloc (β j) (procurement_others_bids β j)