English
Related papers

Related papers: Nonuniform Bribery

200 papers

We study a rating system in which a set of individuals (e.g., the customers of a restaurant) evaluate a given service (e.g, the restaurant), with their aggregated opinion determining the probability of all individuals to use the service and…

Social and Information Networks · Computer Science 2016-06-28 Umberto Grandi , Paolo Turrini

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

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

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

The Coin Change problem, also known as the Change-Making problem, is a well-studied combinatorial optimization problem, which involves minimizing the number of coins needed to make a specific change amount using a given set of coin…

Computational Complexity · Computer Science 2024-11-28 Shreya Gupta , Boyang Huang , Russell Impagliazzo

When humans infer underlying probabilities from stochastic observations, they exhibit biases and variability that cannot be explained on the basis of sound, Bayesian manipulations of probability. This is especially salient when beliefs are…

Neurons and Cognition · Quantitative Biology 2021-07-08 Arthur Prat-Carrabin , Florent Meyniel , Misha Tsodyks , Rava Azeredo da Silveira

We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the…

Computer Science and Game Theory · Computer Science 2018-07-23 Siddharth Barman , Sanath Kumar Krishnamurthy , Rohit Vaish

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

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

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

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

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

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

The long-term success of cryptocurrencies largely depends on the incentive compatibility provided to the validators. Bribery attacks, facilitated trustlessly via smart contracts, threaten this foundation. This work introduces, implements,…

Cryptography and Security · Computer Science 2026-01-14 Bence Soóki-Tóth , István András Seres , Kamilla Kara , Ábel Nagy , Balázs Pejó , Gergely Biczók

Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fairness criteria have been taken into account in this setting.…

Social and Information Networks · Computer Science 2023-02-28 Ruben Becker , Gianlorenzo D'Angelo , Sajjad Ghobadi

Participatory budgeting, as a paradigm for democratic innovations, engages citizens in the distribution of a public budget to projects, which they propose and vote for implementation. So far, voting algorithms have been proposed and studied…

Multiagent Systems · Computer Science 2024-10-30 Sajan Maharjan , Srijoni Majumdar , Evangelos Pournaras

We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the…

Machine Learning · Computer Science 2024-03-04 Viraj Nadkarni , D. Manjunath , Sharayu Moharir

We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have been decided, withdraw some of her false-name identities (have…

Computer Science and Game Theory · Computer Science 2012-09-24 Mingyu Guo , Vincent Conitzer

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…

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

The legitimacy of bottom-up democratic processes for the distribution of public funds by policy-makers is challenging and complex. Participatory budgeting is such a process, where voting outcomes may not always be fair or inclusive.…

Multiagent Systems · Computer Science 2023-07-25 Srijoni Majumdar , Evangelos Pournaras

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek
‹ Prev 1 3 4 5 6 7 10 Next ›