AI can help humans find common ground in democratic deliberation

MH Tessler, MA Bakker, D Jarrett, H Sheahan… - Science, 2024 - science.org
Finding agreement through a free exchange of views is often difficult. Collective deliberation
can be slow, difficult to scale, and unequally attentive to different voices. In this study, we …

A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method

M Schulze - Social choice and Welfare, 2011 - Springer
In recent years, the Pirate Party of Sweden, the Wikimedia Foundation, the Debian project,
the “Software in the Public Interest” project, the Gentoo project, and many other private …

[图书][B] Economics and computation

J Rothe - 2015 - Springer
1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

Approximate strategyproofness

B Lubin, DC Parkes - Current Science, 2012 - JSTOR
The standard approach of mechanism design theory insists on equilibrium behaviour by
participants. This assumption is captured by imposing incentive constraints on the design …

Condorcet attack against fair transaction ordering

MA Vafadar, M Khabbazian - arXiv preprint arXiv:2306.15743, 2023 - arxiv.org
We introduce the Condorcet attack, a new threat to fair transaction ordering. Specifically, the
attack undermines batch-order-fairness, the strongest notion of transaction fair ordering …

The Schulze method of voting

M Schulze - arXiv preprint arXiv:1804.02973, 2018 - arxiv.org
We propose a new single-winner election method (" Schulze method") and prove that it
satisfies many academic criteria (eg monotonicity, reversal symmetry, resolvability …

Elections with few voters: Candidate control can be easy

J Chen, P Faliszewski, R Niedermeier… - Journal of Artificial …, 2017 - jair.org
We study the computational complexity of candidate control in elections with few voters, that
is, we consider the parameterized complexity of candidate control in elections with respect to …

Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters

G Erdélyi, M Neveling, C Reger, J Rothe… - Autonomous Agents and …, 2021 - Springer
We investigate the computational complexity of electoral control in elections. Electoral
control describes the scenario where the election chair seeks to alter the outcome of the …

Weighted electoral control

P Faliszewski, E Hemaspaandra… - Journal of Artificial …, 2015 - jair.org
Although manipulation and bribery have been extensively studied under weighted voting,
there has been almost no work done on election control under weighted voting. This is …

More natural models of electoral control by partition

G Erdélyi, E Hemaspaandra… - … Decision Theory: 4th …, 2015 - Springer
Abstract “Control” studies attempts to set the outcome of elections through the addition,
deletion, or partition of voters or candidates. The set of benchmark control types was largely …