English
Related papers

Related papers: Counteracting Inequality in Markets via Convex Pri…

200 papers

The problem of finding envy-free allocations of indivisible goods can not always be solved; therefore, it is common to study some relaxations such as envy-free up to one good (EF1). Another property of interest for efficiency of an…

Computer Science and Game Theory · Computer Science 2021-09-20 Franklin Camacho , Rigoberto Fonseca-Delgado , Ramón Pino Pérez , Guido Tapia

We study the question of dividing a collection of indivisible goods amongst a set of agents. The main objective of research in the area is to achieve one of two goals: fairness or efficiency. On the fairness side, envy-freeness is the…

Computer Science and Game Theory · Computer Science 2021-06-03 Vishnu V. Narayan , Mashbat Suzuki , Adrian Vetta

We study the problem of fair allocation of a set of indivisible items among agents with additive valuations, under matroid constraints and two generalizations: $p$-extendible system and independence system constraints. The objective is to…

Computer Science and Game Theory · Computer Science 2024-11-07 Yuanyuan Wang , Xin Chen , Qingqin Nong

We present a methodology to robustly estimate the competitive equilibria (CE) of combinatorial markets under the assumption that buyers do not know their precise valuations for bundles of goods, but instead can only provide noisy estimates.…

Computer Science and Game Theory · Computer Science 2021-01-26 Enrique Areyan Viqueira , Cyrus Cousins , Amy Greenwald

This paper proposes a novel framework to price energy storage in economic dispatch with a social welfare maximization objective. This framework can be utilized by power system operators to generate default bids for storage or to benchmark…

Systems and Control · Electrical Eng. & Systems 2026-05-08 Ning Qi , Ningkun Zheng , Bolun Xu

Fair division mechanisms for indivisible goods require agent orderings to deterministically select one allocation when running the algorithm in practice. We introduce position envy-freeness up to one good (PEF1) as a fairness criterion for…

Computer Science and Game Theory · Computer Science 2025-11-18 Ryoga Mahara , Ryuhei Mizutani , Taihei Oki , Tomohiko Yokoyama

Mature internet advertising platforms offer high-level campaign management tools to help advertisers run their campaigns, often abstracting away the intricacies of how each ad is placed and focusing on aggregate metrics of interest to…

Computer Science and Game Theory · Computer Science 2021-09-07 Vincent Conitzer , Christian Kroer , Debmalya Panigrahi , Okke Schrijvers , Eric Sodomka , Nicolas E. Stier-Moses , Chris Wilkens

For the fundamental problem of allocating a set of resources among individuals with varied preferences, the quality of an allocation relates to the degree of fairness and the collective welfare achieved. Unfortunately, in many…

Computer Science and Game Theory · Computer Science 2024-08-30 Mikael Møller Høgsgaard , Panagiotis Karras , Wenyue Ma , Nidhi Rathi , Chris Schwiegelshohn

We consider combinatorial multi-item markets and propose the notion of a $\Delta$-regret Walras equilibrium, which is an allocation of items to players and a set of item prices that achieve the following goals: prices clear the market, the…

Computer Science and Game Theory · Computer Science 2026-02-11 Aloïs Duguet , Tobias Harks , Martin Schmidt , Julian Schwarz

Linear Fisher markets are a fundamental economic model with applications in fair division as well as large-scale Internet markets. In the finite-dimensional case of $n$ buyers and $m$ items, a market equilibrium can be computed using the…

Computer Science and Game Theory · Computer Science 2021-04-06 Yuan Gao , Christian Kroer

In this paper, we consider the problem of fair division of indivisible goods when the allocation of goods impacts society. Specifically, we introduce a second valuation function for each agent, determining the social impact of allocating a…

Computer Science and Game Theory · Computer Science 2024-12-20 Michele Flammini , Gianluigi Greco , Giovanna Varricchio

We study the problem of allocating indivisible items to budget-constrained agents, aiming to provide fairness and efficiency guarantees. Specifically, our goal is to ensure that the resulting allocation is envy-free up to any item (EFx)…

Computer Science and Game Theory · Computer Science 2023-08-04 Marius Garbea , Vasilis Gkatzelis , Xizhi Tan

The problem of pricing the cloud has attracted much recent attention due to the widespread use of cloud computing and cloud services. From a theoretical perspective, several mechanisms that provide strong efficiency or fairness guarantees…

Computer Science and Game Theory · Computer Science 2019-08-16 Ian A. Kash , Peter Key , Warut Suksompong

We consider an environment where sellers compete over buyers. All sellers are a-priori identical and strategically signal buyers about the product they sell. In a setting motivated by on-line advertising in display ad exchanges, where firms…

Computer Science and Game Theory · Computer Science 2012-03-30 Gleb Polevoy , Rann Smorodinsky , Moshe Tennenholtz

We study the problem of fairly allocating indivisible goods to agents with weights corresponding to their entitlements. Previous work has shown that, when agents have binary additive valuations, the maximum weighted Nash welfare rule is…

Theoretical Economics · Economics 2023-10-10 Warut Suksompong , Nicholas Teh

The fair division of resources is an important age-old problem that has led to a rich body of literature. At the center of this literature lies the question of whether there exist fair mechanisms despite strategic behavior of the agents. A…

Computer Science and Game Theory · Computer Science 2017-05-16 Simina Brânzei , Vasilis Gkatzelis , Ruta Mehta

We study fair allocation of indivisible public goods subject to cardinality (budget) constraints. In this model, we have n agents and m available public goods, and we want to select $k \leq m$ goods in a fair and efficient manner. We first…

Computer Science and Game Theory · Computer Science 2021-07-22 Jugal Garg , Pooja Kulkarni , Aniket Murhekar

We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally has a market value. The market valuation can be viewed as a…

Computer Science and Game Theory · Computer Science 2024-10-31 Siddharth Barman , Soroush Ebadian , Mohamad Latifian , Nisarg Shah

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

In fair division, equitability dictates that each participant receives the same level of utility. In this work, we study equitable allocations of indivisible goods among agents with additive valuations. While prior work has studied…

Computer Science and Game Theory · Computer Science 2019-05-28 Rupert Freeman , Sujoy Sikdar , Rohit Vaish , Lirong Xia