English
Related papers

Related papers: Exploring Welfare Maximization and Fairness in Par…

200 papers

Fair clustering has traditionally focused on ensuring equitable group representation or equalizing group-specific clustering costs. However, Dickerson et al. (2025) recently showed that these fairness notions may yield undesirable or…

Machine Learning · Computer Science 2025-08-15 Claire Jie Zhang , Seyed A. Esmaeili , Jamie Morgenstern

In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of self-interested players with a stake in the set of projects chosen. A public planner must choose a subset of these projects, subject to a…

Computer Science and Game Theory · Computer Science 2011-04-19 Shaddin Dughmi

In the context of fair division, the concept of price of fairness has been introduced to quantify the loss of welfare when we have to satisfy some fairness condition. In other words, it is the price we have to pay to guarantee fairness.…

Computer Science and Game Theory · Computer Science 2024-02-27 Karen Frilya Celine , Muhammad Ayaz Dzulfikar , Ivan Adrian Koswara

In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measures the worst-case loss of social welfare due to fairness…

Computer Science and Game Theory · Computer Science 2020-11-03 Siddharth Barman , Umang Bhaskar , Nisarg Shah

In the classical experimental design setting, an experimenter E has access to a population of $n$ potential experiment subjects $i\in \{1,...,n\}$, each associated with a vector of features $x_i\in R^d$. Conducting an experiment with…

Computer Science and Game Theory · Computer Science 2015-03-06 Thibaut Horel , Stratis Ioannidis , S. Muthukrishnan

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 the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in…

Data Structures and Algorithms · Computer Science 2019-05-13 Bhaskar Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , Kurt Mehlhorn

We consider the problem of repeatedly choosing policies to maximize social welfare. Welfare is a weighted sum of private utility and public revenue. Earlier outcomes inform later policies. Utility is not observed, but indirectly inferred.…

Econometrics · Economics 2024-07-30 Nicolo Cesa-Bianchi , Roberto Colomboni , Maximilian Kasy

Allocating resources to individuals in a fair manner has been a topic of interest since the ancient times, with most of the early rigorous mathematical work on the problem focusing on infinitely divisible resources. Recently, there has been…

Computer Science and Game Theory · Computer Science 2022-03-07 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

One of the major concerns of targeting interventions on individuals in social welfare programs is discrimination: individualized treatments may induce disparities across sensitive attributes such as age, gender, or race. This paper…

Econometrics · Economics 2022-07-01 Davide Viviano , Jelena Bradic

Participatory sensing has emerged recently as a promising approach to large-scale data collection. However, without incentives for users to regularly contribute good quality data, this method is unlikely to be viable in the long run. In…

Computer Science and Game Theory · Computer Science 2014-11-24 Tie Luo , Chen-Khong Tham

In settings where players have a limited access to liquidity, represented in the form of budget constraints, efficiency maximization has proven to be a challenging goal. In particular, the social welfare cannot be approximated by a better…

Computer Science and Game Theory · Computer Science 2013-04-29 Shahar Dobzinski , Renato Paes Leme

We study a participatory budgeting problem, where a set of strategic agents wish to split a divisible budget among different projects, by aggregating their proposals on a single division. Unfortunately, the straight-forward rule that…

Computer Science and Game Theory · Computer Science 2022-03-21 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems. When agents value resources in combination rather than in isolation, they must often…

Artificial Intelligence · Computer Science 2013-01-30 Craig Boutilier , Moises Goldszmidt , Bikash Sabata

We study mechanism design problems in the {\em ordinal setting} wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents…

Computer Science and Game Theory · Computer Science 2014-03-11 Deeparnab Chakrabarty , Chaitanya Swamy

We study group decision making with changing preferences as a Markov Decision Process. We are motivated by the increasing prevalence of automated decision-making systems when making choices for groups of people over time. Our main…

Multiagent Systems · Computer Science 2020-11-06 Kshitij Kulkarni , Sven Neth

Human cooperation depends on how accurately we infer others' motives--how much they value fairness, generosity, or self-interest from the choices they make. We model that process in binary dictator games, which isolate moral trade-offs…

Neurons and Cognition · Quantitative Biology 2025-11-12 Gregory Stanley , Jun Zhang , Rick Lewis

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

In standard fair division models, we assume that all agents are selfish. However, in many scenarios, division of resources has a direct impact on the whole group or even society. Therefore, we study fair allocations of indivisible items…

Computer Science and Game Theory · Computer Science 2025-11-13 Argyris Deligkas , Eduard Eiben , Tiger-Lily Goldsmith , Dušan Knop , Šimon Schierreich

We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent receives exactly the same number of goods (the \emph{balanced…

Computer Science and Game Theory · Computer Science 2026-03-09 Yasushi Kawase , Ryoga Mahara