English
Related papers

Related papers: Participatory Budgeting Project Strength via Candi…

200 papers

We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most…

Computer Science and Game Theory · Computer Science 2014-05-27 Yongjie Yang

Purpose: Multiwinner voting rules typically require full knowledge of voter preferences, which becomes impractical in large-scale or attention-limited settings. This paper investigates how accurately a winning committee can be approximated…

Computer Science and Game Theory · Computer Science 2026-04-01 Itay Asher Zimet , Shiri Alouf-Heffetz , Nimrod Talmon

Weighted voting games are a popular class of coalitional games that are widely used to model real-life situations of decision-making. They can be applied, for instance, to analyze legislative processes in parliaments or voting in corporate…

Computer Science and Game Theory · Computer Science 2025-08-20 Joanna Kaczmarek , Jörg Rothe

Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…

Artificial Intelligence · Computer Science 2009-05-25 Toby Walsh

In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multiple battles to fight, and the budgets get consumed over…

Computer Science and Game Theory · Computer Science 2016-02-15 Chu-Han Cheng , Po-An Chen , Wing-Kai Hon

It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for many election systems, but for all studied systems the winner…

Computer Science and Game Theory · Computer Science 2018-11-14 Zack Fitzsimmons , Edith Hemaspaandra , Alexander Hoover , David E. Narváez

Crowdsensing, also known as participatory sensing, is a method of data collection that involves gathering information from a large number of common people (or individuals), often using mobile devices or other personal technologies. This…

Computer Science and Game Theory · Computer Science 2024-05-17 Chattu Bhargavi , Vikash Kumar Singh

We study sincere-strategy preference-based approval voting (SP-AV), a system proposed by Brams and Sanver [Electoral Studies, 25(2):287-305, 2006], and here adjusted so as to coerce admissibility of the votes (rather than excluding…

Computer Science and Game Theory · Computer Science 2009-06-12 Gabor Erdelyi , Markus Nowak , Joerg Rothe

We initiate the study of voting rules for participatory budgeting using the so-called epistemic approach, where one interprets votes as noisy reflections of some ground truth regarding the objectively best set of projects to fund. Using…

Computer Science and Game Theory · Computer Science 2024-09-05 Simon Rey , Ulle Endriss

We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his…

Computational Complexity · Computer Science 2015-05-20 Britta Dorn , Ildikó Schlotter

Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative…

Computer Science and Game Theory · Computer Science 2015-03-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Curtis Menton

Cumulative and quadratic voting are two distributional voting methods that are expressive, promoting fairness and inclusion, particularly in the realm of participatory budgeting. Despite these benefits, graphical voter interfaces for…

We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an unbounded number of manipulators.

Computer Science and Game Theory · Computer Science 2020-07-31 Julian Müller , Sven Kosub

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

We present a new model of collective decision making that captures important crowd-funding and donor coordination scenarios. In the setting, there is a set of projects (each with its own cost) and a set of agents (that have their budgets as…

Computer Science and Game Theory · Computer Science 2021-01-29 Haris Aziz , Aditya Ganguly

We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…

Optimization and Control · Mathematics 2016-05-04 Ashkan Jasour , Constantino Lagoa

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number $k$ of new candidates will be added. We…

Artificial Intelligence · Computer Science 2015-02-17 Yann Chevaleyre , Jérôme Lang , Nicolas Maudet , Jérôme Monnot , Lirong Xia

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

In social choice there often arises a conflict between the majority principle (the search for a candidate that is as good as possible for as many voters as possible), and the protection of minority rights (choosing a candidate that is not…

Computer Science and Game Theory · Computer Science 2023-04-06 Egor Ianovski , Aleksei Y. Kondratev
‹ Prev 1 4 5 6 7 8 10 Next ›