balanced_draft_value_order
def
The strict preference order induced by a real value vector, ordered first by increasing value and then by increasing good index; hence a maximum is a highest-valued good and ties favor the larger index.
Statement
noncomputable def balanced_draft_value_order {m : ℕ} (v : Fin m → ℝ) : LinearOrder (Fin m)
- Source
- Definitions and auxiliary facts for OP-1493, the joint Gaussian limit for balanced sincere drafting.
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 5
- balanced_draft_normalized_utility_boundsIf an agent assigns nonnegative values to all goods, her normalized utility under any schedule lies between zero and the number of agents,…
- two_agent_draft_welfareGiven a number of goods m : ℕ, a drafting schedule s : Fin m → Fin 2 of length m, and a valuation profile v : Fin 2 → Fin m → ℝ, the…
- balanced_draft_normalized_utilityFor a schedule and a real valuation profile, multiply an agent's sincere-draft bundle value by the number of agents and divide by her…
- balanced_draft_value_order_iffIn the induced order, a good is at most another exactly when its value is smaller, or the values agree and its index is at most the other…
- two_agent_welfare_regret_nonnegFor any number of goods m : ℕ, any drafting schedule s : Fin m → Fin 2 of length m, and any nonnegative valuation profile v : Fin 2 → Fin…
Lean source view module on GitHub
open MeasureTheory ProbabilityTheory Filter open scoped BigOperators Topology noncomputable def balanced_draft_value_order {m : ℕ} (v : Fin m → ℝ) : LinearOrder (Fin m) := LinearOrder.lift' (fun g => toLex (v g, g)) (by intro g h heq exact congrArg Prod.snd (congrArg ofLex heq))