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

@article{Ping2021MostEW, title={Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences}, author={Haoyue Ping and Julia Stoyanovich}, journal={ArXiv}, year={2021}, volume={abs/2105.00082} }

It remains an open question how to determine the winner of an election given incomplete or uncertain voter preferences. One solution is to assume some probability space for the voting profile and declare the candidates having the best chance of winning to be the (co-)winners. We refer to this as the Most Probable Winner (MPW). In this paper, we propose an alternative winner interpretation for positional scoring rules — the Most Expected Winner (MEW), based on the expected performance of the… Expand

#### References

SHOWING 1-10 OF 30 REFERENCES

CoRR

- abs/2005.06779,
- 2020

Analyzing and Modeling Rank Data

- Mathematics
- 1996

Introduction Looking at data Formal tests of uniformity: summary statistics and distances Comparing several samples Overview of models Some axiomatics Likelihood methods and exponential families… Expand

Counting linear extensions is #P-complete

- Mathematics, Computer Science
- STOC '91
- 1991

We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. This settles a long-standing open question and contrssts with recent results… Expand

AAAI 2010

- Atlanta, Georgia, USA, July 11-15, 2010,
- 2010

The repeated insertion model for rankings: Missing link between two subset choice models

- Mathematics
- 2004

Several probabilistic models for subset choice have been proposed in the literature, for example, to explain approval voting data. We show that Marley et al.'s latent scale model is subsumed by… Expand

A Voting-Based System for Ethical Decision Making

- Computer Science
- AAAI
- 2018

The proposed approach is to learn a model of societal preferences, and, when faced with a specific ethical dilemma at runtime, efficiently aggregate those preferences to identify a desirable choice. Expand

Probabilistic Inference Over Repeated Insertion Models

- Computer Science
- AAAI
- 2018

This paper proposes an algorithm for computing the marginal probability of an arbitrary partially ordered set over RIM and analyzes the complexity of the algorithm in terms of properties of the model and the partial order, captured by a novel measure termed the “cover width”. Expand

Sohan Dsouza, Iyad Rahwan, Pradeep Ravikumar, and Ariel D. Procaccia. A voting-based system for ethical decision making

- Proceedings of AAAI
- 2018

Effective sampling and learning for mallows models with pairwise-preference data

- Mathematics, Computer Science
- J. Mach. Learn. Res.
- 2014

This work develops the first algorithms for learning Mallows models (and mixtures thereof) from pairwise comparison data, and develops approximate samplers that are exact for many important special cases and have provable bounds with pairwise evidence. Expand