English
Related papers

Related papers: Bribery Can Get Harder in Structured Multiwinner A…

200 papers

Time-series models typically assume untainted and legitimate streams of data. However, a self-interested adversary may have incentive to corrupt this data, thereby altering a decision maker's inference. Within the broader field of…

Cryptography and Security · Computer Science 2024-02-22 William N. Caballero , Jose Manuel Camacho , Tahir Ekin , Roi Naveiro

In multiple criteria decision aiding, very often the alternatives are compared by means of a value function compatible with the preferences expressed by the Decision Maker. The problem is that, in general, there is a plurality of compatible…

Optimization and Control · Mathematics 2023-04-14 Sally Giuseppe Arcidiacono , Salvatore Corrente , Salvatore Greco

A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating…

Data Structures and Algorithms · Computer Science 2017-11-22 Robert Bredereck , Piotr Faliszewski , Rolf Niedermeier , Piotr Skowron , Nimrod Talmon

Participatory Budgeting (PB) is commonly studied from an axiomatic perspective, where the aim is to design procedurally fair and economically efficient rules for voters with full information regarding their preferences. In contrast, we take…

Computer Science and Game Theory · Computer Science 2026-01-28 Qishen Han , Artem Ivaniuk , Edith Elkind , Lirong Xia

An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency --- this paper focusses on the former case where interference is caused by the environment of a…

Logic in Computer Science · Computer Science 2016-01-12 Cliff B. Jones , Ian J. Hayes

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

In a recently introduced model of successive committee elections (Bredereck et al., AAAI-20) for a given set of ordinal or approval preferences one aims to find a sequence of a given length of "best" same-size committees such that each…

Computer Science and Game Theory · Computer Science 2025-05-27 Pallavi Jain , Andrzej Kaczmarczyk

We examine an approval-based model of Liquid Democracy with a budget constraint on voting and delegating costs, aiming to centrally select casting voters ensuring complete representation of the electorate. From a computational complexity…

Computer Science and Game Theory · Computer Science 2025-02-05 Shiri Alouf-Heffetz , Łukasz Janeczko , Grzegorz Lisowski , Georgios Papasotiropoulos

We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer…

Computer Science and Game Theory · Computer Science 2016-11-28 Gal Cohensius , Shie Manor , Reshef Meir , Eli Meirom , Ariel Orda

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

We study the classical Election problem in anonymous net- works, where solutions can rely on the use of random bits, which may be either shared or unshared among nodes. We provide a complete char- acterization of the conditions under which…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-06 Jérémie Chalopin , Emmanuel Godard

We consider a voting scenario in which the resource to be voted upon may consist of both indivisible and divisible goods. This setting generalizes both the well-studied model of multiwinner voting and the recently introduced model of cake…

Computer Science and Game Theory · Computer Science 2024-10-14 Xinhang Lu , Jannik Peters , Haris Aziz , Xiaohui Bei , Warut Suksompong

In the metric distortion problem, a set of voters and candidates lie in a common metric space, and a committee of $k$ candidates must be elected. The objective is to minimize a social cost, defined as a function of the distances between…

Computer Science and Game Theory · Computer Science 2025-10-16 Javier Cembrano , Golnoosh Shahkarami

To successfully complete a complex project, be it a construction of an airport or of a backbone IT system, agents (companies or individuals) must form a team having required competences and resources. A team can be formed either by the…

Computer Science and Game Theory · Computer Science 2016-09-16 Piotr Skowron , Krzysztof Rzadca , Anwitaman Datta

We study the production, entry, and technological decisions of firms in the presence of bribery. We find that bribery can be justified even in the absence of bureaucratic inefficiencies. We document substantial technology-specific…

General Economics · Economics 2025-07-21 Jafar M. Olimov , Yi-Chan Tsai , Hao-Yu Yang

Participatory budgeting refers to the practice of allocating public resources by collecting and aggregating individual preferences. Most existing studies in this field often assume an additive utility function, where each individual holds a…

Computer Science and Game Theory · Computer Science 2024-06-21 Jing Yuan , Shaojie Tang

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

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

Computer Science and Game Theory · Computer Science 2026-04-21 Davin Choo , Paul W. Goldberg , Nicholas Teh

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions…

Artificial Intelligence · Computer Science 2010-07-30 Jessica Davies , George Katsirelos , Nina Narodystka , Toby Walsh
‹ Prev 1 8 9 10 Next ›