English
Related papers

Related papers: Utilitarian Guarantees for the Method of Equal Sha…

200 papers

We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational…

Computer Science and Game Theory · Computer Science 2025-08-13 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

Participatory budgeting (PB) has been widely adopted and has attracted significant research efforts; however, there is a lack of mechanisms for PB which elicit project interactions, such as substitution and complementarity, from voters.…

Computer Science and Game Theory · Computer Science 2023-07-17 Mohak Goyal , Sahasrajit Sarmasarkar , Ashish Goel

A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Privacy can be rigorously quantified using the framework of {\em differential privacy}, which…

Databases · Computer Science 2009-03-20 Arpita Ghosh , Tim Roughgarden , Mukund Sundararajan

The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible goods. While MMS allocations do not always exist, several approximation techniques have been developed to ensure that all agents receive a fraction…

Computer Science and Game Theory · Computer Science 2021-05-21 Hadi Hosseini , Andrew Searns

We consider a task of scheduling with a common deadline on a single machine. Every player reports to a scheduler the length of his job and the scheduler needs to finish as many jobs as possible by the deadline. For this simple problem,…

Computer Science and Game Theory · Computer Science 2011-03-15 Uriel Feige , Moshe Tennenholtz

We consider a participatory budgeting problem in which each voter submits a proposal for how to divide a single divisible resource (such as money or time) among several possible alternatives (such as public projects or activities) and these…

Computer Science and Game Theory · Computer Science 2022-01-24 Rupert Freeman , David M. Pennock , Dominik Peters , Jennifer Wortman Vaughan

The classic house allocation problem is primarily concerned with finding a matching between a set of agents and a set of houses that guarantees some notion of economic efficiency (e.g. utilitarian welfare). While recent works have shifted…

Computer Science and Game Theory · Computer Science 2024-07-08 Hadi Hosseini , Medha Kumar , Sanjukta Roy

In an indivisible participatory budgeting (PB) framework, we have a limited budget that is to be distributed among a set of projects, by aggregating the preferences of voters for the projects. All the prior work on indivisible PB assumes…

Computer Science and Game Theory · Computer Science 2023-05-19 Gogulapati Sreedurga

How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory…

Computer Science and Game Theory · Computer Science 2012-07-10 Richard Cole , Vasilis Gkatzelis , Gagan Goel

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

Data Structures and Algorithms · Computer Science 2021-09-14 Alfonso Cevallos , Alistair Stewart

We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

Computer Science and Game Theory · Computer Science 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang

To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is…

Theoretical Economics · Economics 2020-09-17 Anna bogomolnaia , Herve Moulin

In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on envy-freeness up to one good (EF1) as the fairness…

Computer Science and Game Theory · Computer Science 2023-07-14 Umang Bhaskar , Neeldhara Misra , Aditi Sethia , Rohit Vaish

We study ways of evaluating the performance of losing projects in participatory budgeting (PB) elections by seeking actions that would have led to their victory. We focus on lowering the projects' costs, obtaining additional approvals for…

Computer Science and Game Theory · Computer Science 2025-02-19 Niclas Boehmer , Piotr Faliszewski , Łukasz Janeczko , Dominik Peters , Grzegorz Pierczyński , Šimon Schierreich , Piotr Skowron , Stanisław Szufa

We study the problem of computing \emph{fair} divisions of a set of indivisible goods among agents with \emph{additive} valuations. For the past many decades, the literature has explored various notions of fairness, that can be primarily…

Computer Science and Game Theory · Computer Science 2025-01-22 Hannaneh Akrami , Nidhi Rathi

We study the efficiency (in terms of social welfare) of truthful and symmetric mechanisms in one-sided matching problems with {\em dichotomous preferences} and {\em normalized von Neumann-Morgenstern preferences}. We are particularly…

Computer Science and Game Theory · Computer Science 2014-09-18 Marek Adamczyk , Piotr Sankowski , Qiang Zhang

In this paper, we propose a general operating scheme which allows the utility company to jointly perform power procurement and demand response so as to maximize the social welfare. Our model takes into consideration the effect of the…

Optimization and Control · Mathematics 2011-12-06 Longbo Huang , Jean Walrand , Kannan Ramchandran

Budget aggregation is a process in which citizens vote by declaring their individual ideal budget allocation, and a pre-determined rule aggregates all votes into a single outcome. Recent theoretical work has proposed various aggregation…

Computer Science and Game Theory · Computer Science 2026-04-14 Ayelet Amster , Lioz Akirav , Rica Gonen , Erel Segal-Halevi

In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large…

Computer Science and Game Theory · Computer Science 2024-09-10 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

We study fair allocation of constrained resources, where a market designer optimizes overall welfare while maintaining group fairness. In many large-scale settings, utilities are not known in advance, but are instead observed after…

Computer Science and Game Theory · Computer Science 2024-11-06 Elita Lobo , Justin Payan , Cyrus Cousins , Yair Zick