English
Related papers

Related papers: Participatory Budgeting Project Strength via Candi…

200 papers

We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations are based on the…

Computer Science and Game Theory · Computer Science 2020-11-24 Kishen N. Gowda , Neeldhara Misra , Vraj Patel

Participatory Budgeting (PB) is a form of participatory democracy in which citizens select a set of projects to be implemented, subject to a budget constraint. The Method of Equal Shares (MES), introduced in [18], is a simple iterative…

Computer Science and Game Theory · Computer Science 2023-10-17 Sonja Kraiczy , Edith Elkind

We investigate the complexity of several manipulation and control problems under numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we study include approval voting (AV), satisfaction approval voting (SAV),…

Computer Science and Game Theory · Computer Science 2023-09-06 Yongjie Yang

This research considers the ranking and selection with input uncertainty. The objective is to maximize the posterior probability of correctly selecting the best alternative under a fixed simulation budget, where each alternative is measured…

Optimization and Control · Mathematics 2023-05-15 Hui Xiao , Zhihong Wei

We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational…

Computer Science and Game Theory · Computer Science 2025-08-13 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

This paper focuses on managing the cost of deliberation before action. In many problems, the overall quality of the solution reflects costs incurred and resources consumed in deliberation as well as the cost and benefit of execution, when…

Artificial Intelligence · Computer Science 2013-04-05 David Einav , Michael R. Fehling

We introduce the notion of {\em Distance Restricted Manipulation}, where colluding manipulator(s) need to compute if there exist votes which make their preferred alternative win the election when their knowledge about the others' votes is a…

Computer Science and Game Theory · Computer Science 2020-11-30 Aditya Anand , Palash Dey

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler

Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having the same input types) control types that are about the same…

Computer Science and Game Theory · Computer Science 2025-11-12 Benjamin Carleton , Michael C. Chavrimootoo , Lane A. Hemaspaandra , David E. Narváez , Conor Taliancich , Henry B. Welles

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

Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Andrea Turrini , Holger Hermanns

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

Nanson's and Baldwin's voting rules select a winner by successively eliminating candidates with low Borda scores. We show that these rules have a number of desirable computational properties. In particular, with unweighted votes, it is…

Artificial Intelligence · Computer Science 2011-06-28 Nina Narodytska , Toby Walsh , Lirong Xia

Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-10-13 Muhammad Mahbubur Rahman , Afroza Nahar

We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals. For instance, one goal is to make sure that a given pair of agents is matched in a stable…

Computer Science and Game Theory · Computer Science 2021-08-23 Niclas Boehmer , Robert Bredereck , Klaus Heeger , Rolf Niedermeier

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

Computer Science and Game Theory · Computer Science 2022-11-28 Kunal Relia

We develop and apply epistemic tests to various decentralized governance methods as well as to study the impact of participation. These tests probe the ability to reach a correct outcome when there is one. We find that partial abstention is…

Social and Information Networks · Computer Science 2025-05-08 Jeff Strnad

In this paper, we consider a population of individuals who have actions and opinions, which coevolve, mutually influencing one another on a complex network structure. In particular, we formulate a control problem for this social network, in…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Roberta Raineri , Mengbin Ye , Lorenzo Zino

As the rapid proliferation of AI systems and harms spurs efforts in AI governance around the world, prioritizing among competing policy options has become increasingly challenging for policymakers and researchers. We introduce a methodology…

Computers and Society · Computer Science 2026-05-28 Julia Barnett , Kimon Kieslich , Natali Helberger , Nicholas Diakopoulos