研究人员将度量社交选择中的随机度量失真上限改进至 2.3282。这一新上限通过混合随机规模的稳定彩票和集成否决法实现，超过了之前 2.5 的最佳记录。证明过程运用了先进的技术，包括圆锥线性规划对偶和 Bernstein 基验证。 AI
排序理由 该集群包含一篇详细介绍理论研究成果的新学术论文。[lever_c_demoted from research: ic=1 ai=0.1]
AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →
新研究将随机度量失真上限改进至 2.3282
本文如何被排名
- Signal score
- 1 / 100
- Composite score across the factors below. Higher = stronger signal that this story matters right now.
- Newsworthiness bucket
- Tool
- 该集群包含一篇详细介绍理论研究成果的新学术论文。[lever_c_demoted from research: ic=1 ai=0.1]
- Source corroboration
- Single-source cluster
- Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
- Topics
- paper, other
- Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
- AI-industry relevance
- Low
- Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
- Story freshness
- Same-day
- Cluster formed today. Ranking reflects the current source set at time of score.
完整方法见我们的编辑标准。
报道来源 [1]
-
将随机度量失真改进至 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 average distance to the voters. A randomized voting rule must use only the rankin…