English
Related papers

Related papers: Discrete Budget Aggregation: Truthfulness and Prop…

200 papers

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

We introduce a general approach based on \emph{selective verification} and obtain approximate mechanisms without money for maximizing the social welfare in the general domain of utilitarian voting. Having a good allocation in mind, a…

Computer Science and Game Theory · Computer Science 2015-07-10 Dimitris Fotakis , Christos Tzamos , Emmanouil Zampetakis

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by…

Computer Science and Game Theory · Computer Science 2013-01-14 Paul W. Goldberg , Carmine Ventre

Motivated by civic problems such as participatory budgeting and multiwinner elections, we consider the problem of public good allocation: Given a set of indivisible projects (or candidates) of different sizes, and voters with different…

Computer Science and Game Theory · Computer Science 2021-10-26 Kamesh Munagala , Yiheng Shen , Kangning Wang , Zhiyi Wang

We consider the participatory budgeting problem where each of $n$ voters specifies additive utilities over $m$ candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most…

Computer Science and Game Theory · Computer Science 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang

Majority voting is one of the few black-box interventions that can improve a fixed stochastic predictor: repeated access can be cheaper than changing a high-capability model. Classical fixed-competence theory makes this intervention look…

Machine Learning · Computer Science 2026-05-08 Yi Liu

In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree…

Computer Science and Game Theory · Computer Science 2022-02-02 Sonja Kraiczy , Edith Elkind

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

Computer Science and Game Theory · Computer Science 2025-08-04 Matthew M. Casey , Edith Elkind

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…

Computer Science and Game Theory · Computer Science 2022-05-25 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…

Theoretical Economics · Economics 2022-05-25 Arash Abizadeh , Adrian Vetta

We study the fair and truthful allocation of m divisible public items among n agents, each with distinct preferences for the items. To aggregate agents' preferences fairly, we focus on finding a core solution. For divisible items, a core…

Computer Science and Game Theory · Computer Science 2026-02-03 Pouya Kananian , Arnesh Sujanani , Seyed Majid Zahedi

In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. In this setting, there are selfish agents, which control some of the requests characteristics, and may be dishonest about…

Data Structures and Algorithms · Computer Science 2008-12-18 Yossi Azar , Iftah Gamzu , Shai Gutner

We study the fair division of divisible bad resources with strategic agents who can manipulate their private information to get a better allocation. Within certain constraints, we are particularly interested in whether truthful envy-free…

Computer Science and Game Theory · Computer Science 2023-01-24 Mohammad Azharuddin Sanpui

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

The executive branch, or government, is typically not elected directly by the people, but rather formed by another elected body or person such as the parliament or the president. As a result, its members are not directly accountable to the…

Multiagent Systems · Computer Science 2023-12-11 Rutvik Page , Ehud Shapiro , Nimrod Talmon

In many real-life situations that involve exchanges of arguments, individuals may differ on their assessment of which supports between the arguments are in fact justified, i.e., they put forward different support-relations. When confronted…

Artificial Intelligence · Computer Science 2021-06-23 Weiwei Chen

We introduce and study strongly truthful mechanisms and their applications. We use strongly truthful mechanisms as a tool for implementation in undominated strategies for several problems,including the design of externality resistant…

Computer Science and Game Theory · Computer Science 2012-08-21 Amos Fiat , Anna R. Karlin , Elias Koutsoupias , Angelina Vidali

Emerging methods for participatory algorithm design have proposed collecting and aggregating individual stakeholder preferences to create algorithmic systems that account for those stakeholders' values. Using algorithmic student assignment…

Computers and Society · Computer Science 2020-07-15 Samantha Robertson , Niloufar Salehi

As artificial agents become increasingly capable, what internal structure is *necessary* for an agent to act competently under uncertainty? Classical results show that optimal control can be *implemented* using belief states or world…

Machine Learning · Computer Science 2026-04-03 Aran Nayebi

This paper studies mechanism design for auctions with externalities on budgets, a novel setting where the budgets that bidders commit are adjusted due to the externality of the competitors' allocation outcomes-a departure from traditional…

Computer Science and Game Theory · Computer Science 2025-04-22 Yusen Zheng , Yukun Cheng , Chenyang Xu , Xiaotie Deng
‹ Prev 1 8 9 10 Next ›