Standard Simplex Conjecture for ranked choice voting
Let ρ∈(0,1)\rho\in(0,1)ρ∈(0,1) and n≥k!+k−1n\geq k!+k-1n≥k!+k−1. Consider partitions Ω1,…,Ωk\Omega_1,\ldots,\Omega_kΩ1,…,Ωk of Rn\mathbb{R}^nRn with Gaussian measure γn(Ωi)=1/k\gamma_n(\Omega_i)=1/kγn(Ωi)=1/k that maximize the ranked-choi…