[图书][B] Handbook of computational social choice
The rapidly growing field of computational social choice, at the intersection of computer
science and economics, deals with the computational aspects of collective decision making …
science and economics, deals with the computational aspects of collective decision making …
[PDF][PDF] Efficient Vote Elicitation under Candidate Uncertainty.
Top-k voting is an especially natural form of partial vote elicitation in which only length k
prefixes of rankings are elicited. We analyze the ability of top-k vote elicitation to correctly …
prefixes of rankings are elicited. We analyze the ability of top-k vote elicitation to correctly …
[PDF][PDF] Sample complexity for winner prediction in elections
P Dey, A Bhattacharyya - Proceedings of the 2015 International …, 2015 - aamas.csc.liv.ac.uk
Predicting the winner of an election is a favorite problem both for news media pundits and
computational social choice theorists. Since it is often infeasible to elicit the preferences of …
computational social choice theorists. Since it is often infeasible to elicit the preferences of …
On the likelihood of single-peaked preferences
ML Lackner, M Lackner - Social Choice and Welfare, 2017 - Springer
This paper contains an extensive combinatorial analysis of the single-peaked domain
restriction and investigates the likelihood that an election is single-peaked. We provide a …
restriction and investigates the likelihood that an election is single-peaked. We provide a …
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
P Andrieu, S Cohen-Boulakia, M Couceiro… - International Journal of …, 2023 - Elsevier
The aggregation of multiple rankings into a consensus ranking is a crucial task in various
domains such as search engine results or user-based ratings. This task poses significant …
domains such as search engine results or user-based ratings. This task poses significant …
Predicting winner and estimating margin of victory in elections using sampling
A Bhattacharyya, P Dey - Artificial Intelligence, 2021 - Elsevier
Predicting the winner of an election and estimating the margin of victory of that election are
favorite problems both for news media pundits and computational social choice theorists …
favorite problems both for news media pundits and computational social choice theorists …
Multiwinner voting with possibly unavailable candidates
Selecting a committee that meets diversity and proportionality criteria is a challenging
endeavor that has been studied extensively in recent years. This task becomes even more …
endeavor that has been studied extensively in recent years. This task becomes even more …
Parameterized complexity of candidate nomination for elections based on positional scoring rules
I Schlotter, K Cechlárová, D Trellová - Autonomous Agents and Multi-Agent …, 2024 - Springer
Consider elections where the set of candidates is partitioned into parties, and each party
must nominate exactly one candidate. The Possible President problem asks whether some …
must nominate exactly one candidate. The Possible President problem asks whether some …
Probabilistic inference of winners in elections by independent random voters
A Imber, B Kimelfeld - arXiv preprint arXiv:2101.12524, 2021 - arxiv.org
We investigate the problem of computing the probability of winning in an election where
voter attendance is uncertain. More precisely, we study the setting where, in addition to a …
voter attendance is uncertain. More precisely, we study the setting where, in addition to a …
Preference aggregation in the generalised unavailable candidate model
While traditional social choice models assume that the set of candidates is known and fixed
in advance, recently several researchers [2, 5, 7, 15, 18] have proposed to reject this …
in advance, recently several researchers [2, 5, 7, 15, 18] have proposed to reject this …