English
Related papers

Related papers: Discrete Budget Aggregation: Truthfulness and Prop…

200 papers

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating the preferences of community members to determine an…

Computer Science and Game Theory · Computer Science 2016-10-17 Brandon Fain , Ashish Goel , Kamesh Munagala

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

Wisdom of the crowd revealed a striking fact that the majority answer from a crowd is often more accurate than any individual expert. We observed the same story in machine learning--ensemble methods leverage this idea to combine multiple…

Machine Learning · Computer Science 2019-10-01 Tianyi Luo , Yang Liu

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection of an alternative that is less preferred. The…

Multiagent Systems · Computer Science 2015-02-17 Palash Dey , Neeldhara Misra , Y. Narahari

We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as…

Computer Science and Game Theory · Computer Science 2014-09-12 Aris Filos-Ratsikas , Peter Bro Miltersen

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…

Computer Science and Game Theory · Computer Science 2024-08-02 Ganesh Ghalme , Reshef Meir

Many models of economics assume that individuals distort objective probabilities. We propose a simple consistency condition on distortion functions, which we term distortion coherence, that ensures that the function commutes with…

Theoretical Economics · Economics 2024-06-10 Christopher P. Chambers , Yusufcan Masatlioglu , Collin Raymond

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-unit auctions that is truthful in expectation, whereas there…

Computer Science and Game Theory · Computer Science 2009-08-24 Shahar Dobzinski , Shaddin Dughmi

We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…

General Economics · Economics 2025-05-19 Ali Lazrak , Jianfeng Zhang

A divisible budget must be allocated to several projects, and agents are asked for their opinion on how much they would give to each project. We consider that an agent is satisfied by a division of the budget if, for at least a certain…

Computer Science and Game Theory · Computer Science 2025-02-04 Laurent Gourvès , Michael Lampis , Nikolaos Melissinos , Aris Pagourtzis

In this paper we analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them(e.g., transitivity when describing preferences).…

Computer Science and Game Theory · Computer Science 2013-06-20 Ilan Nehama

We formalize a framework for coordinating funding and selecting projects, the costs of which are shared among agents with quasi-linear utility functions and individual budgets. Our model contains the classical discrete participatory…

Computer Science and Game Theory · Computer Science 2023-02-24 Haris Aziz , Sujit Gujar , Manisha Padala , Mashbat Suzuki , Jeremy Vollen

We study the mechanism design problem of allocating a set of indivisible items without monetary transfers. Despite the vast literature on this very standard model, it still remains unclear how do truthful mechanisms look like. We focus on…

Computer Science and Game Theory · Computer Science 2017-05-31 Georgios Amanatidis , Georgios Birmpas , George Christodoulou , Evangelos Markakis

Disaggregated evaluation across subgroups is critical for assessing the fairness of machine learning models, but its uncritical use can mislead practitioners. We show that equal performance across subgroups is an unreliable measure of…

We introduce a principle of local collection for compositional truth predicates and show that it is conservative over the classically compositional theory of truth in the arithmetical setting. This axiom states that upon restriction to…

Logic · Mathematics 2020-06-22 Mateusz Łełyk , Bartosz Wcisło

Participatory budgeting is a democratic approach to deciding the funding of public projects, which has been adopted in many cities across the world. We present a survey of research on participatory budgeting emerging from the computational…

Computer Science and Game Theory · Computer Science 2020-03-03 Haris Aziz , Nisarg Shah

A major achievement of mechanism design theory is a general method for the construction of truthful mechanisms called VCG (Vickrey, Clarke, Groves). When applying this method to complex problems such as combinatorial auctions, a difficulty…

Computer Science and Game Theory · Computer Science 2011-10-04 N. Nisan , A. Ronen