arXiv AI
Outer Diversity of Condorcet Domains
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
2d ago
Query-efficient winner prediction in district-based elections
arXiv:2610.00577v1 Announce Type: cross Abstract: In a district-based election, N voters are partitioned into k districts, and each voter votes for one of m candidates. Each district elects a winner...
arXiv AI
Sep 10
Improving Randomized Metric Distortion to 2.1441
The paper announces an improved upper bound on the distortion of randomized voting rules in metric social choice, reducing it from the previous range of $[2.1126,2.5]$ to $2.1441$. It introduces the concept of random-size stable lotteries, proves their existence, and derives the new bound via a potential argument. The proofs were generated with GPT-5.6-Sol and subsequently verified and simplified by the author.
arXiv Machine Learning
Sep 16
On the disintegration of the stochastic majority vote: From PAC-Bayesian bounds to a self-bounding algorithm
The paper introduces a derandomization framework for stochastic majority vote classifiers, converting PAC‑Bayesian guarantees into deterministic majority vote guarantees. By applying disintegrated PAC‑Bayesian theory to the space of vote weight vectors, the authors derive two families of high‑probability generalization bounds for both data‑independent and data‑dependent ensembles. These bounds naturally lead to a self‑bounding learning algorithm that optimizes deterministic majority vote performance.
arXiv AI
Sep 1
Improving Randomized Metric Distortion to 2.3282
arXiv:2608.29308v1 Announce Type: cross Abstract: In metric social choice, each voter ranks a set of $m$ candidates by her distance to them in an unknown metric space. The cost of a candidate is its...
arXiv AI
Jun 16
Ranking Abuse via Strategic Pairwise Data Perturbations
arXiv:2604. 17805v2 Announce Type: replace-cross Abstract: Pairwise ranking systems based on Maximum Likelihood Estimation (MLE), such as the Bradley-Terry model, are widely used to aggregate preferences from pairwise comparisons.
arXiv AI
Jun 2
Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs
arXiv:2606. 01400v1 Announce Type: cross Abstract: Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming.