English
Related papers

Related papers: Maximum Welfare Allocations under Quantile Valuati…

200 papers

We study the problem of allocating indivisible items on a path among agents. The objective is to find a fair and efficient allocation in which each agent's bundle forms a contiguous block on the line. We say that an instance is \emph{$(a,…

Computer Science and Game Theory · Computer Science 2025-01-14 Yasushi Kawase , Bodhayan Roy , Mohammad Azharuddin Sanpui

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

We study the problem of allocating indivisible goods among agents that have an identical subadditive valuation over the goods. The extent of fairness and efficiency of allocations is measured by the generalized means of the values that the…

Computer Science and Game Theory · Computer Science 2020-05-04 Siddharth Barman , Ranjani G. Sundaram

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 analyze the run-time complexity of computing allocations that are both fair and maximize the utilitarian social welfare, defined as the sum of agents' utilities. We focus on two tractable fairness concepts: envy-freeness up to one item…

Computer Science and Game Theory · Computer Science 2024-09-23 Haris Aziz , Xin Huang , Nicholas Mattei , Erel Segal-Halevi

We study the fair allocation of indivisible items to $n$ agents to maximize the utilitarian social welfare, where the fairness criterion is envy-free up to one item and there are only two different utility functions shared by the agents. We…

Computer Science and Game Theory · Computer Science 2025-09-12 Jiaxuan Ma , Yong Chen , Guangting Chen , Mingyang Gong , Guohui Lin , An Zhang

A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible items are allocated to consumers and demandants with different…

Optimization and Control · Mathematics 2026-05-28 Manouchehr Zaker

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

Fair allocation of indivisible goods studies allocating $m$ goods among $n$ agents in a fair manner. While fairness is a fundamental requirement in many real-world applications, it often conflicts with (economic) efficiency. This raises a…

Computer Science and Game Theory · Computer Science 2025-06-03 Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , Biaoshuai Tao

This paper considers quantile-welfare evaluation of social welfare as an alternative to utilitarian evaluation. Manski (1988) originally proposed and studied maximization of quantile utility as a model of individual decision making under…

Econometrics · Economics 2026-04-17 Charles F. Manski , John Mullahy

We present a recommender system based on the Random Utility Model. Online shoppers are modeled as rational decision makers with limited information, and the recommendation task is formulated as the problem of optimally enriching the…

Computer Science and Game Theory · Computer Science 2024-09-24 Benjamin Heymann , Flavian Vasile , David Rohde

We consider the problem of allocating multiple indivisible items to a set of networked agents to maximize the social welfare subject to network externalities. Here, the social welfare is given by the sum of agents' utilities and…

Computer Science and Game Theory · Computer Science 2023-08-29 S. Rasoul Etesami

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

Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might arise. We study the…

Computer Science and Game Theory · Computer Science 2022-02-04 Niclas Boehmer , Robert Bredereck , Klaus Heeger , Dušan Knop , Junjie Luo

We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgraph. Our focus is on both egalitarian and utilitarian…

Computer Science and Game Theory · Computer Science 2026-01-21 Xiaohui Bei , Alexander Lam , Xinhang Lu , Warut Suksompong

We study a general allocation setting where agent valuations are concave additive. In this model, a collection of items must be uniquely distributed among a set of agents, where each agent-item pair has a specified utility. The objective is…

Data Structures and Algorithms · Computer Science 2022-03-15 Nathaniel Kell , Kevin Sun

We study the problem of maximizing Nash social welfare, which is the geometric mean of agents' utilities, in two well-known models. The first model involves one-sided preferences, where a set of indivisible items is allocated among a group…

Computer Science and Game Theory · Computer Science 2025-05-19 Salil Gokhale , Harshul Sagar , Rohit Vaish , Vignesh Viswanathan , Jatin Yadav

We initiate the study of multidimensional Bayesian utility maximization, focusing on the unit-demand setting where values are i.i.d. across both items and buyers. The seminal result of Hartline and Roughgarden '08 studies simple,…

Computer Science and Game Theory · Computer Science 2025-02-18 Kira Goldner , Taylor Lundy

This paper is merged with arXiv:2107.08965v2. We refer the reader to the full and updated version. We study the problem of allocating a set of indivisible goods among agents with 2-value additive valuations. Our goal is to find an…

Computer Science and Game Theory · Computer Science 2021-10-13 Hannaneh Akrami , Bhaskar Ray Chaudhury , Kurt Mehlhorn , Golnoosh Shahkarami , Quentin Vermande

A multiagent system may be thought of as an artificial society of autonomous software agents and we can apply concepts borrowed from welfare economics and social choice theory to assess the social welfare of such an agent society. In this…

Multiagent Systems · Computer Science 2011-09-30 U. Endriss , N. Maudet , F. Sadri , F. Toni
‹ Prev 1 2 3 10 Next ›