English(EN) Query-efficient winner prediction in district-based elections

新算法以更少的查询次数改进选举获胜者预测

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-02 04:00

研究人员开发了一种新的自适应随机算法，以提高查询效率来预测基于选区的选举获胜者。该算法旨在最大限度地减少确定选举结果所需的查询次数，这对于出口民意调查等场景尤其重要。与之前的算法相比，新方法提供了更好的界限，特别适用于候选人众多且选区人口分布不均的选举。 AI

影响这项研究可以为政治学和数据分析中的AI应用提供信息，特别是在优化选举过程的数据收集和预测模型方面。

排序理由详细介绍新算法的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 4 / 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.4]
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: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

arXiv cs.AI TIER_1 English(EN) · Koustav De, Debajyoti Kar, Swagato Sanyal · 2026-10-02 04:00

基于区域的选举中查询效率高的获胜者预测

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 using the plurality rule (i.e. the candidate getting the largest number of votes …