English
Related papers

Related papers: Strategic Partitioning and Manipulability in Two-R…

200 papers

We study the voter model dynamics in the presence of confidence and bias. We assume two types of voters. Unbiased voters whose confidence is indifferent to the state of the voter and biased voters whose confidence is biased towards a common…

Physics and Society · Physics 2022-08-10 Agnieszka Czaplicka , Christos Charalambous , Raul Toral , Maxi San Miguel

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

In this paper, we propose a new averaging model for modeling the competitive influence of $K$ candidates among $n$ voters in an election process. For such an influence propagation model, we address the question of how many seeded voters a…

Social and Information Networks · Computer Science 2020-09-22 Yu-Hsien Peng , Ping-En Lu , Cheng-Shang Chang , Duan-Shin Lee

When fitting statistical models, some predictors are often found to be correlated with each other, and functioning together. Many group variable selection methods are developed to select the groups of predictors that are closely related to…

Methodology · Statistics 2021-03-25 Zhiyuan Li

We introduce a general semiparametric clusterwise elliptical distribution to assess how latent cluster structure shapes continuous outcomes. Using a subjectwise representation, we first estimate cluster-specific mean vectors and a…

Methodology · Statistics 2026-04-10 Jen-Chieh Teng , Sheng-Hsin Fan , Chin-Tsang Chiang , Ming-Yueh Huang , Alvin Lim

Many hard computational social choice problems are known to become tractable when voters' preferences belong to a restricted domain, such as those of single-peaked or single-crossing preferences. However, to date, all algorithmic results of…

Computer Science and Game Theory · Computer Science 2016-02-12 Edith Elkind , Martin Lackner

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

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

Polarization is a major concern for a well-functioning society. Often, mass polarization of a society is driven by polarizing political representation, even when the latter is easily preventable. The existing computational social choice…

Computer Science and Game Theory · Computer Science 2025-09-03 Chris Dong , Martin Bullinger , Tomasz Wąs , Larry Birnbaum , Edith Elkind

We use the United States Supreme Court as an illuminative context in which to discuss three different spatial voting preference models: an instance of the widely used single-peaked preferences, and two models that are more novel in which…

Computational Geometry · Computer Science 2018-10-30 Noah Giansiracusa , Cameron Ricciardi

We study the voting game where agents' preferences are endogenously decided by the information they receive, and they can collaborate in a group. We show that strategic voting behaviors have a positive impact on leading to the ``correct''…

Computer Science and Game Theory · Computer Science 2023-05-23 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

In an election campaign, candidates must decide how to optimally allocate their efforts/resources optimally among the regions of a country. As a result, the outcome of the election will depend on the players' strategies and the voters'…

Computer Science and Game Theory · Computer Science 2020-12-08 Sebastián Morales , Charles Thraves

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

How much influence can a coordinated coalition exert in a multiwinner Top-$k$ election under a positional scoring rule? We study the maximum displacement problem: with coalition size $m$, how many of the current top-$k$ winners can be…

Computer Science and Game Theory · Computer Science 2026-01-26 Qian Guo , Yidan Hu , Rui Zhang

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-26 Pierre Fraigniaud , Ran Gelles , Zvi Lotker

Real-world recommendation systems often consist of two phases. In the first phase, multiple predictive models produce the probability of different immediate user actions. In the second phase, these predictions are aggregated according to a…

The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candidates, equal numbers of voters, and where all the (ordinal)…

Computer Science and Game Theory · Computer Science 2026-01-27 Piotr Faliszewski , Jitka Mertlová , Pierre Nunn , Stanisław Szufa , Tomasz Wąs

We focus on the election manipulation problem through social influence, where a manipulator exploits a social network to make her most preferred candidate win an election. Influence is due to information in favor of and/or against one or…

Artificial Intelligence · Computer Science 2020-03-02 Matteo Castiglioni , Nicola Gatti , Giulia Landriani , Diodato Ferraioli

We propose a framework for strategic voting when a voter may lack knowledge about the preferences of other voters, or about other voters' knowledge about her own preference. In this setting we define notions of manipulation, equilibrium,…

Computer Science and Game Theory · Computer Science 2021-11-30 Zeinab Bakhtiari , Hans van Ditmarsch , Abdallah Saffidine