Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences

Author:

Ping Haoyue1ORCID,Stoyanovich Julia1ORCID

Affiliation:

1. New York University, New York City, NY, USA

Abstract

It remains an open question how to determine the winner of an election when voter preferences are incomplete or uncertain. One option is to assume some probability space over the voting profile and select the Most Probable Winner (MPW) -- the candidate or candidates with the best chance of winning. In this paper, we propose an alternative winner interpretation, selecting the Most Expected Winner (MEW) according to the expected performance of the candidates. We separate the uncertainty in voter preferences into the generation step and the observation step, which gives rise to a unified voting profile combining both incomplete and probabilistic voting profiles. We use this framework to establish the theoretical hardness of MEW over incomplete voter preferences, and then identify a collection of tractable cases for a variety of voting profiles, including those based on the popular Repeated Insertion Model (RIM) and its special case, the Mallows model. We develop solvers customized for various voter preference types to quantify the candidate performance for the individual voters, and propose a pruning strategy that optimizes computation. The performance of the proposed solvers and pruning strategy is evaluated extensively on real and synthetic benchmarks, showing that our methods are practical.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Reference33 articles.

1. Probabilistic Possible Winner Determination

2. Graham R. Brightwell and Peter Winkler. 1991. Counting Linear Extensions is #P-Complete . In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5--8 , 1991 , New Orleans, Louisiana, USA. 175--181. https://doi.org/10.1145/103418.103441 10.1145/103418.103441 Graham R. Brightwell and Peter Winkler. 1991. Counting Linear Extensions is #P-Complete. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5--8, 1991, New Orleans, Louisiana, USA. 175--181. https://doi.org/10.1145/103418.103441

3. Average heights in partially ordered sets;Bruggemann Rainer;MATCH Commun Math Comput Chem,2014

4. Algorithmic Techniques for Necessary and Possible;Chakraborty Vishal;Winners. Trans. Data Sci.,2021

5. Approximation of average ranks in posets;Loof Karel De;Match Commun Math Comput Chem,2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3