English
Related papers

Related papers: Electoral Competition under Best-Worst Voting Rule…

200 papers

Commercial entries, such as hotels, are ranked according to score by a search engine or recommendation system, and the score of each can be improved upon by making a targeted investment, e.g., advertising. We study the problem of how a…

Computer Science and Game Theory · Computer Science 2022-03-29 Amir Ban , Moshe Tennenholtz

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

We consider a voting setting where candidates have preferences about the outcome of the election and are free to join or leave the election. The corresponding candidacy game, where candidates choose strategically to participate or not, has…

Computer Science and Game Theory · Computer Science 2016-02-25 Jérôme Lang , Nicolas Maudet , Maria Polukarov , Alice Cohen-Hadria

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

We study a variant of the Hotelling-Downs model of spatial competition between firms where consumer choices are influenced by their individual preferences as well as the popularity of the firms. In general, a multiplicity of market…

Computer Science and Game Theory · Computer Science 2024-01-17 Gaëtan Fournier , Marc Schröder

In this paper we study variations of the standard Hotelling-Downs model of spatial competition, where each agent attracts the clients in a restricted neighborhood, each client randomly picks one attractive agent for service. Two utility…

Computer Science and Game Theory · Computer Science 2016-11-21 Weiran Shen , Zihe Wang

Voting algorithms have been widely used as consensus protocols in the realization of fault-tolerant systems. These algorithms are best suited for distributed systems of nodes with low computational power or heterogeneous networks, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-16 Sebastian Müller , Andreas Penzkofer , Darcy Camargo , Olivia Saa

We study the convergence of best-response dynamics in lottery contests. We show that best-response dynamics rapidly converges to the (unique) equilibrium for homogeneous agents but may not converge for non-homogeneous agents, even for two…

Computer Science and Game Theory · Computer Science 2023-05-19 Abheek Ghosh , Paul W. Goldberg

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…

Probability · Mathematics 2025-04-25 Dorje C. Brody , Tomooki Yuasa

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

Computer Science and Game Theory · Computer Science 2019-01-23 Grzegorz Pierczyński , Piotr Skowron

We consider a spatial voting model where both candidates and voters are positioned in the $d$-dimensional Euclidean space, and each voter ranks candidates based on their proximity to the voter's ideal point. We focus on the scenario where…

Computer Science and Game Theory · Computer Science 2025-05-20 Hadas Shachnai , Rotem Shavitt , Andreas Wiese

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis

We study candidates' positioning when adjustments are possible in response to new information about voters' preferences. Re-positioning allows candidates to get closer to the median voter but is costly both financially and electorally. We…

Computer Science and Game Theory · Computer Science 2023-05-05 Gaëtan Fournier , Alberto Grillo , Yevgeny Tsodikovich

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

Probability · Mathematics 2012-05-31 Joe Neeman

Making a decision is often a matter of listing and comparing positive and negative arguments. In such cases, the evaluation scale for decisions should be considered bipolar, that is, negative and positive values should be explicitly…

Artificial Intelligence · Computer Science 2014-01-16 Didier Dubois , Hélène Fargier , Jean-François Bonnefon