arXiv (All)
open access
Kelly's conjectures on Condorcet winner probabilities for odd electorates
Let $C(m,n)$ denote the probability that, among $n$ independent uniformly random permutations of $m$ labels, there exists a label that precedes every other label in a strict majority of the permutations. We prove that $C(m,n)>C(m,n+2)$ for $m \ge 3$ and odd $n \ge 1$, and that $C(m,n)>C(m+1,n)$ for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A sharp bound on the binding number of $K_k$-free graphs and the Brandt conjecture#1412595
- Deterministic Metric Distortion of Top-2 Voting#1326340
- A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities#1034496
- Deficit bounds and equality cases in the Tu--Deng problem#1122479
- Existence of the Core in Approval-Based Committee Elections#999588
Record · ID 1414584
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive