English
Related papers

Related papers: Nash Social Welfare Approximation for Strategic Ag…

200 papers

We study linear Fisher markets with satiation. In these markets, sellers have earning limits and buyers have utility limits. Beyond natural applications in economics, these markets arise in the context of maximizing Nash social welfare when…

Data Structures and Algorithms · Computer Science 2019-08-01 Jugal Garg , Martin Hoefer , Kurt Mehlhorn

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 bandwidth allocation, competing agents wish to transmit data along paths of links in a network, and each agent's utility is equal to the minimum bandwidth she receives among all links in her desired path. Recent market mechanisms for…

Computer Science and Game Theory · Computer Science 2019-05-08 Benjamin Plaut

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

We study the relationship between two central concepts in the allocation of divisible goods: competitive equilibrium (CE) and allocations that maximize Nash welfare, i.e., allocations where the weighted geometric mean of the utilities is…

Computer Science and Game Theory · Computer Science 2026-03-18 Jugal Garg , Yixin Tao , László A. Végh

We study coverage problems in which, for a set of agents and a given threshold $T$, the goal is to select $T$ subsets (of the agents) that, while satisfying combinatorial constraints, achieve fair and efficient coverage among the agents. In…

Computer Science and Game Theory · Computer Science 2022-07-06 Siddharth Barman , Anand Krishna , Y. Narahari , Soumyarup Sadhukhan

We study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare-defined as the geometric mean of agents' valuations for their assigned bundles-stands as…

Computer Science and Game Theory · Computer Science 2021-10-27 Siddharth Barman , Paritosh Verma

We consider a market in which both suppliers and consumers compete for a product via scalar-parameterized supply offers and demand bids. Scalar-parameterized offers/bids are appealing due to their modeling simplicity and desirable…

General Economics · Economics 2020-03-04 Mariola Ndrio , Khaled Alshehri , Subhonmesh Bose

We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and…

Computer Science and Game Theory · Computer Science 2023-10-09 Alexander Lam , Haris Aziz , Toby Walsh

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

A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency --…

Computer Science and Game Theory · Computer Science 2024-01-17 Michal Feldman , Simon Mauras , Tomasz Ponitka

Much work has been done on the computation of market equilibria. However due to strategic play by buyers, it is not clear whether these are actually observed in the market. Motivated by the observation that a buyer may derive a better…

Computer Science and Game Theory · Computer Science 2015-05-18 Bharat Adsul , Ch. Sobhan Babu , Jugal Garg , Ruta Mehta , Milind Sohoni

We study incentive-compatible mechanisms that maximize the Nash Social Welfare. Since traditional incentive-compatible mechanisms cannot maximize the Nash Social Welfare even approximately, we propose changing the traditional model.…

Computer Science and Game Theory · Computer Science 2024-02-23 Shahar Dobzinski , Sigal Oren , Jan Vondrak

Nash equilibrium is a common solution concept that captures strategic interaction in electricity market analysis. However, it requires a fundamental but impractical assumption that all market participants are fully rational, implying…

Computer Science and Game Theory · Computer Science 2024-07-15 Lihui Yi , Ermin Wei

The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016…

Computer Science and Game Theory · Computer Science 2020-12-08 Xiaowei Wu , Bo Li , Jiarui Gan

A Fisher market is an economic model of buyer and seller interactions in which each buyer's utility depends only on the bundle of goods she obtains. Many people's interests, however, are affected by their social interactions with others. In…

Computer Science and Game Theory · Computer Science 2023-03-14 Jiayi Zhao , Denizalp Goktas , Amy Greenwald

We study the problem of efficiently and fairly allocating a set of indivisible goods among agents with identical and additive valuations for the goods. The objective is to maximize the Nash social welfare, which is the geometric mean of the…

Data Structures and Algorithms · Computer Science 2022-01-06 Asei Inoue , Yusuke Kobayashi

This paper investigates the efficiency loss in social cost caused by strategic bidding behavior of individual participants in a supply-demand balancing market, and proposes a mechanism to fully recover equilibrium social optimum via…

Optimization and Control · Mathematics 2021-06-22 Kaiying Lin , Beibei Wang , Pengcheng You

We consider the problem of designing distribution rules to share "welfare" (cost or revenue) among individually strategic agents. There are many known distribution rules that guarantee the existence of a (pure) Nash equilibrium in this…

Computer Science and Game Theory · Computer Science 2014-02-18 Ragavendran Gopalakrishnan , Jason R. Marden , Adam Wierman

We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most compelling notion of fairness in the context of…

Computer Science and Game Theory · Computer Science 2020-08-18 Bhaskar Ray Chaudhury , Jugal Garg , Ruta Mehta
‹ Prev 1 2 3 10 Next ›