English
Related papers

Related papers: On the Complexity of Destructive Bribery in Approv…

200 papers

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been…

Computational Complexity · Computer Science 2015-03-19 Gábor Erdélyi , Michael Fellows , Jörg Rothe , Lena Schend

The growing need for labeled training data has made crowdsourcing an important part of machine learning. The quality of crowdsourced labels is, however, adversely affected by three factors: (1) the workers are not experts; (2) the…

Computer Science and Game Theory · Computer Science 2015-09-08 Nihar B. Shah , Dengyong Zhou , Yuval Peres

Several elections run in the last years have been characterized by attempts to manipulate the result of the election through the diffusion of fake or malicious news over social networks. This problem has been recognized as a critical issue…

Computer Science and Game Theory · Computer Science 2023-08-22 Vincenzo Auletta , Francesco Carbone , Diodato Ferraioli

Current reinforcement learning methods fail if the reward function is imperfect, i.e. if the agent observes reward different from what it actually receives. We study this problem within the formalism of Corrupt Reward Markov Decision…

Machine Learning · Computer Science 2019-07-02 Jason Mancuso , Tomasz Kisielewski , David Lindner , Alok Singh

The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the…

Computer Science and Game Theory · Computer Science 2021-06-25 Zack Fitzsimmons , Edith Hemaspaandra

We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. To select the best possible committee, instead of voting for a candidate, a voter is allowed to approve…

Computer Science and Game Theory · Computer Science 2020-08-17 Venkateswara Rao Kagita , Arun K Pujari , Vineet Padmanabhan , Vikas Kumar

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

Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control…

Computer Science and Game Theory · Computer Science 2015-09-03 Sergey Polyakovskiy , Rudolf Berghammer , Frank Neumann

We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several…

Computer Science and Game Theory · Computer Science 2020-12-10 Pallavi Jain , Krzysztof Sornat , Nimrod Talmon , Meirav Zehavi

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The…

Data Structures and Algorithms · Computer Science 2020-08-11 Shlomo Moran , Irad Yavneh

The first step in classifying the complexity of an NP problem is typically showing the problem in P or NP-complete. This has been a successful first step for many problems, including voting problems. However, in this paper we show that this…

Computer Science and Game Theory · Computer Science 2022-07-08 Zack Fitzsimmons , Edith Hemaspaandra

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

Computer Science and Game Theory · Computer Science 2019-05-31 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

It is a challenging task to reach global cooperation among self-interested agents, which often requires sophisticated design or usage of incentives. For example, we may apply supervisors or referees who are able to detect and punish…

Physics and Society · Physics 2024-12-20 Ting Ling , Zhang Li , Minyu Feng , Attila Szolnoki

Multi-winner voting plays a crucial role in selecting representative committees based on voter preferences. Previous research has predominantly focused on single-stage voting rules, which are susceptible to manipulation during preference…

Computer Science and Game Theory · Computer Science 2024-02-06 Shengjie Gong , Lingxiao Huang , Shuangping Huang , Yuyi Wang , Zhiqi Wang , Tao Xiao , Xiang Yan , Chunxue Yang

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

This paper considers two fundamental sequential decision-making problems: the problem of prediction with expert advice and the multi-armed bandit problem. We focus on stochastic regimes in which an adversary may corrupt losses, and we…

Machine Learning · Statistics 2021-09-24 Shinji Ito

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

Computer Science and Game Theory · Computer Science 2023-07-19 Hari Sarang Nathan

In multiple-question referendum elections, the separability problem occurs when a voter's preferences on some questions or proposals depend on the predicted outcomes of others. The notion of separability formalizes the study of…

Combinatorics · Mathematics 2018-02-08 Beth Bjorkman , Sean Gravelle , Jonathan Hodge

Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees. The Necessary President problem asks whether a candidate, if…

Computer Science and Game Theory · Computer Science 2026-02-12 Katarína Cechlárová , Ildikó Schlotter

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

Computer Science and Game Theory · Computer Science 2023-12-14 Markus Brill , Jannik Peters
‹ Prev 1 8 9 10 Next ›