English
Related papers

Related papers: Participatory Budgeting Project Strength via Candi…

200 papers

We focus on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections with preferential dependencies. Under this rule, voters…

Computer Science and Game Theory · Computer Science 2025-06-10 Evangelos Markakis , Georgios Papasotiropoulos

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2013-10-28 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (each ranking the candidates from the best to the worst), a despised candidate $d$, a budget $B$,…

Artificial Intelligence · Computer Science 2020-05-07 Andrzej Kaczmarczyk , Piotr Faliszewski

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…

Probability · Mathematics 2025-04-25 Dorje C. Brody , Tomooki Yuasa

A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of elections, such as manipulation (i.e., strategic voting), control,…

Computer Science and Game Theory · Computer Science 2013-07-30 Piotr Faliszewski , Yannick Reisch , Jörg Rothe , Lena Schend

We propose automated techniques for the verification and control of probabilistic real-time systems that are only partially observable. To formally model such systems, we define an extension of probabilistic timed automata in which local…

Logic in Computer Science · Computer Science 2015-06-24 Gethin Norman , David Parker , Xueyi Zou

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

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

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Jerome Lang , Tuomas Sandholm

Humans routinely confront the following key question which could be viewed as a probabilistic variant of the controllability problem: While faced with an uncertain environment governed by causal structures, how should they practice their…

Artificial Intelligence · Computer Science 2015-12-08 Ardavan Salehi Nobandegani , Ioannis N. Psaromiligkos

The bribery problem in election has received considerable attention in the literature, upon which various algorithmic and complexity results have been obtained. It is thus natural to ask whether we can protect an election from potential…

Computational Complexity · Computer Science 2020-07-07 Lin Chen , Ahmed Sunny , Lei Xu , Shouhuai Xu , Zhimin Gao , Yang Lu , Weidong Shi , Nolan Shah

Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social…

Social and Information Networks · Computer Science 2019-07-03 Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo , Stefano Ponziani

In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…

Optimization and Control · Mathematics 2024-04-30 Marc Goerigk , Mohammad Khosravi

Political campaigns involve, in the simplest case, two competing campaign groups which try to obtain a majority of votes. We propose a novel mathematical framework to study political campaign dynamics on social networks whose constituents…

Physics and Society · Physics 2018-03-05 L. Böttcher , Hans J. Herrmann , Hans Gersbach

We introduce a family of normative principles to assess fairness in the context of participatory budgeting. These principles are based on the fundamental idea that budget allocations should be fair in terms of the resources invested into…

Computer Science and Game Theory · Computer Science 2023-02-21 Jan Maly , Simon Rey , Ulle Endriss , Martin Lackner

In participatory budgeting (PB), voters decide through voting which subset of projects to fund within a given budget. Proportionality in the context of PB is crucial to ensure equal treatment of all groups of voters. However, pure…

Computer Science and Game Theory · Computer Science 2025-07-08 Georgios Papasotiropoulos , Seyedeh Zeinab Pishbin , Oskar Skibski , Piotr Skowron , Tomasz Wąs

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

Computer Science and Game Theory · Computer Science 2025-12-05 Jannik Peters

Participatory Design (PD) seeks political change to support people's democratic control over processes, solutions, and, in general, matters of concern to them. A particular challenge remains in supporting vulnerable groups to gain power and…

Human-Computer Interaction · Computer Science 2022-07-20 Aakash Gautam , Deborah Tatar

A negotiating team is a group of two or more agents who join together as a single negotiating party because they share a common goal related to the negotiation. Since a negotiating team is composed of several stakeholders, represented as a…

Computer Science and Game Theory · Computer Science 2021-08-03 Leora Schmerler , Noam Hazon

A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive counterparts seem to be less explored. This paper investigates…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh