English
Related papers

Related papers: When Votes Change and Committees Should (Not)

200 papers

Consider a committee election consisting of (i) a set of candidates who are divided into arbitrary groups each of size ${at~most}$ two and a diversity constraint that stipulates the selection of ${at~least}$ one candidate from each group…

Computational Complexity · Computer Science 2025-10-22 Kunal Relia

The adaptive voter model is widely used to model opinion dynamics in social complex networks. However, existing adaptive voter models are limited to only pairwise interactions and fail to capture the intricate social dynamics that arises in…

Physics and Society · Physics 2025-02-04 Anastasia Golovin , Jan Mölter , Christian Kuehn

We consider iterative voting models and position them within the general framework of acyclic games and game forms. More specifically, we classify convergence results based on the underlying assumptions on the agent scheduler (the order of…

Multiagent Systems · Computer Science 2018-08-13 Reshef Meir , Maria Polukarov , Jeffrey S. Rosenschein , Nicholas R. Jennings

Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is…

Computer Science and Game Theory · Computer Science 2017-06-09 Zack Fitzsimmons , Edith Hemaspaandra , Lane A. Hemaspaandra

Electing a committee of size k from m alternatives (k < m) is an interesting problem under the multi-winner voting rules. However, very few committee selection rules found in the literature consider the coalitional possibilities among the…

Theoretical Economics · Economics 2023-08-08 Ritu Dutta , Rajnish Kumnar , Surajit Borkotokey

In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate $p$, and a budget. The goal is to ensure that $p$ wins by shifting $p$ higher in some voters' preference orders. However, each such…

Multiagent Systems · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Piotr Faliszewski , André Nichterlein , Rolf Niedermeier

Strategic manipulation of elections is typically studied in the context of promoting individual candidates. In parliamentary elections, however, the focus shifts: voters may care more about the overall governing coalition than the…

Computer Science and Game Theory · Computer Science 2026-01-13 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

We investigate the phenomena of political bi-polarization in a population of interacting agents by means of a generalized version of the model introduced in PRE E 101, 012101 (2020) for the dynamics of voting intention. Each agent has a…

Physics and Society · Physics 2020-07-15 Nicolas Saintier , Juan Pablo Pinasco , Federico Vazquez

We investigate a dynamical model of opinion formation in which an individual's opinion is influenced by interactions with a group of other agents. We introduce a bias towards one of the opinions in a manner not considered earlier to the…

Physics and Society · Physics 2024-09-17 Pratik Mullick , Parongama Sen

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

In the celebrated stable-matching problem, there are two sets of agents M and W, and the members of M only have preferences over the members of W and vice versa. It is usually assumed that each member of M and W is a single entity. However,…

Computer Science and Game Theory · Computer Science 2024-08-21 Leora Schmerler , Noam Hazon , Sarit Kraus

In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who eventually votes along with the subset of voters whose votes they…

Computer Science and Game Theory · Computer Science 2020-12-01 Palash Dey , Arnab Maiti , Amatya Sharma

Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study…

Data Structures and Algorithms · Computer Science 2024-05-27 Sushmita Gupta , Tanmay Inamdar , Pallavi Jain , Daniel Lokshtanov , Fahad Panolan , Saket Saurabh

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

Committee decisions are complicated by a deadline, e.g., the next start of a budget, or the beginning of a semester. In committee hiring decisions, it may be that if no candidate is supported by a strong majority, the default is to hire no…

Computers and Society · Computer Science 2024-01-09 Marina Bannikova , Lihi Dery , Svetlana Obraztsova , Zinovi Rabinovich , Jeffrey S. Rosenschein

We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among…

Data Structures and Algorithms · Computer Science 2025-10-23 Martin Bullinger , Gergely Csáji , Rohith Reddy Gangam , Parnian Shahkar

Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…

Computer Science and Game Theory · Computer Science 2013-02-08 Serge Gaspers , Victor Naroditskiy , Nina Narodytska , Toby Walsh

We investigate the coarsening dynamics of a simplified version of the persistent voter model in which an agent can become a zealot -- i.e. resistent to change opinion -- at each step, based on interactions with its nearest neighbors. We…

Statistical Mechanics · Physics 2026-03-17 R. G. de Almeida , J. J. Arenzon , F. Corberi , W. G. Dantas , L. Smaldone

Abstract Like electoral systems, decision-making methods are also vulnerable to manipulation by decision-makers. The ability to effectively defend against such threats can only come from thoroughly understanding the manipulation mechanisms.…

Artificial Intelligence · Computer Science 2024-03-25 Jacek Szybowski , Konrad Kułakowski , Jiri Mazurek , Sebastian Ernst
‹ Prev 1 3 4 5 6 7 10 Next ›