English
Related papers

Related papers: Markets Beyond Nash Welfare for Leontief Utilities

200 papers

Large scale multiagent systems must rely on distributed decision making, as centralized coordination is either impractical or impossible. Recent works approach this problem under a game theoretic lens, whereby utility functions are assigned…

Computer Science and Game Theory · Computer Science 2021-02-10 Rahul Chandan , Dario Paccagnan , Jason R. Marden

The $\alpha$-fair resource allocation problem has received remarkable attention and has been studied in numerous application fields. Several algorithms have been proposed in the context of $\alpha$-fair resource sharing to distributively…

Networking and Internet Architecture · Computer Science 2018-02-09 Zaid Allybokus , Konstantin Avrachenkov , Jérémie Leguay , Lorenzo Maggi

We propose a new model for aggregating preferences over a set of indivisible items based on a quantile value. In this model, each agent is endowed with a specific quantile, and the value of a given bundle is defined by the corresponding…

Computer Science and Game Theory · Computer Science 2026-05-06 Haris Aziz , Shivika Narang , Mashbat Suzuki

The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guaranteed to exist. Classical works have avoided this issue by…

Computer Science and Game Theory · Computer Science 2021-05-06 Hiromichi Goko , Ayumi Igarashi , Yasushi Kawase , Kazuhisa Makino , Hanna Sumita , Akihisa Tamura , Yu Yokoi , Makoto Yokoo

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric…

Computer Science and Game Theory · Computer Science 2024-07-10 Yasushi Kawase , Koichi Nishimura , Hanna Sumita

In this paper, we study a strategic model of marketing and product consumption in social networks. We consider two competing firms in a market providing two substitutable products with preset qualities. Agents choose their consumptions…

Social and Information Networks · Computer Science 2014-04-08 Arastoo Fazeli , Amir Ajorlou , Ali Jadbabaie

We study the problem of allocating a set of indivisible goods among a set of agents in a fair and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1), which means that each agent prefers its own bundle…

Computer Science and Game Theory · Computer Science 2018-05-14 Siddharth Barman , Sanath Kumar Krishnamurthy , Rohit Vaish

Decentralized decision making in multi--product firms can lead to efficiency losses when autonomous decision makers fail to internalize cross--product demand interactions. This paper quantifies the magnitude of such losses by analyzing the…

Computer Science and Game Theory · Computer Science 2026-01-27 Boxiao Chen , Jiashuo Jiang , Stefanus Jasin

This paper investigates design of noncooperative games from an optimization and control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of a fairly general class of noncooperative…

Computer Science and Game Theory · Computer Science 2010-07-02 Tansu Alpcan , Lacra Pavel , Nem Stefanovic

In approval-based budget division, the task is to allocate a divisible resource to the candidates based on the voters' approval preferences over the candidates. For this setting, Brandl et al. [2021] have shown that no distribution rule can…

Computer Science and Game Theory · Computer Science 2026-05-13 Haris Aziz , Patrick Lederer , Jeremy Vollen

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

Envy-free up to one good (EF1) and envy-free up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In…

Computer Science and Game Theory · Computer Science 2020-07-15 Alireza Farhadi , MohammadTaghi Hajiaghayi , Mohamad Latifian , Masoud Seddighin , Hadi Yami

We consider the scenario where $N$ utilities strategically bid for electricity in the day-ahead market and balance the mismatch between the committed supply and actual demand in the real-time market, with uncertainty in demand and local…

Systems and Control · Electrical Eng. & Systems 2021-09-15 Tianyu Zhao , Hanling Yi , Minghua Chen , Chenye Wu , Yunjian Xu

This paper studies the efficiency of battery storage operations in electricity markets by comparing the social welfare gain achieved by a central planner to that of a decentralized profit-maximizing operator. The problem is formulated in a…

Computer Science and Game Theory · Computer Science 2026-02-24 Zhile Jiang , Xinhao Nie , Stratis Skoulakis

We establish a compatibility between fairness and efficiency, captured via Nash Social Welfare (NSW), under the broad class of subadditive valuations. We prove that, for subadditive valuations, there always exists a partial allocation that…

Computer Science and Game Theory · Computer Science 2025-11-10 Siddharth Barman , Mashbat Suzuki

We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability.…

Computer Science and Game Theory · Computer Science 2021-09-08 Xiaohui Bei , Xinhang Lu , Pasin Manurangsi , Warut Suksompong

Recently Bramoulle and Kranton presented a model for the provision of public goods over a network and showed the existence of a class of Nash equilibria called specialized equilibria wherein some agents exert maximum effort while other…

Computer Science and Game Theory · Computer Science 2022-01-25 Parthe Pandit , Ankur A. Kulkarni

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

Incorporating budget constraints into the analysis of auctions has become increasingly important, as they model practical settings more accurately. The social welfare function, which is the standard measure of efficiency in auctions, is…

Computer Science and Game Theory · Computer Science 2015-11-05 Yossi Azar , Michal Feldman , Nick Gravin , Alan Roytman

We study the fair allocation problem of indivisible items with subsidy. In this paper, we focus on the notion of fairness - equitability (EQ), which requires that items be allocated such that all agents value the bundle they receive…

Computer Science and Game Theory · Computer Science 2025-09-10 Yuanyuan Wang , Tianze Wei
‹ Prev 1 4 5 6 7 8 10 Next ›