English
Related papers

Related papers: Optimal Nash Equilibria for Bandwidth Allocation

200 papers

In the allocation of indivisible goods, the maximum Nash welfare (MNW) rule, which chooses an allocation maximizing the product of the agents' utilities, has received substantial attention for its fairness. We characterize MNW as the only…

Theoretical Economics · Economics 2022-12-20 Warut Suksompong

We consider the problem of fairly allocating indivisible goods to agents with weights representing their entitlements. A natural rule in this setting is the maximum weighted Nash welfare (MWNW) rule, which selects an allocation maximizing…

Theoretical Economics · Economics 2022-04-26 Warut Suksompong , Nicholas Teh

Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness.…

Computer Science and Game Theory · Computer Science 2019-02-13 Ioannis Caragiannis , Nick Gravin , Xin Huang

A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-interested users. Most game-theoretic models applied to system…

Computer Science and Game Theory · Computer Science 2007-05-23 Nicolas Christin , Jens Grossklags , John Chuang

This paper proposes a novel energy sharing mechanism for prosumers who can produce and consume. Different from most existing works, the role of individual prosumer as a seller or buyer in our model is endogenously determined. Several…

Optimization and Control · Mathematics 2019-10-08 Yue Chen , Shengwei Mei , Fengyu Zhou , Steven H. Low , Wei Wei , Feng Liu

Consider a barter exchange problem over a finite set of agents, where each agent owns an item and is also associated with a (privately known) wish list of items belonging to the other agents. An outcome of the problem is a (re)allocation of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yuval Emek , Matan-El Shpiro

In contrast with existing works which rely on the same type of energy-efficiency measure to design distributed power control policies, the present work takes into account the presence of a finite packet buffer at the transmitter side and…

Networking and Internet Architecture · Computer Science 2016-11-17 Vineeth S. Varma , Samson Lasaulce , Yezekael Hayel , Salah Eddine Elayoubi

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power…

Information Theory · Computer Science 2015-01-20 Krishna Chaitanya A , Utpal Muherji , Vinod Sharma

We study the problem of allocating indivisible goods among $n$ agents with the objective of maximizing Nash social welfare (NSW). This welfare function is defined as the geometric mean of the agents' valuations and, hence, it strikes a…

Computer Science and Game Theory · Computer Science 2022-07-18 Siddharth Barman , Anand Krishna , Pooja Kulkarni , Shivika Narang

Network slicing (NS) is a key technology in 5G networks that enables the customization and efficient sharing of network resources to support the diverse requirements of nextgeneration services. This paper proposes a resource allocation…

Computer Science and Game Theory · Computer Science 2023-08-01 Mandar Datar , Naresh Modina , Rachid El , Eitan Altman

Mobile traffic explosion causes spectrum shortage and polarization of data usage among users, which will eventually decrease user welfare in mobile communication services. Governments around the world are planning to make more spectrum…

Computer Science and Game Theory · Computer Science 2014-08-05 Seung Min Yu , Seong-Lyun Kim

We study fair allocation of indivisible goods among agents. Prior research focuses on additive agent preferences, which leads to an impossibility when seeking truthfulness, fairness, and efficiency. We show that when agents have binary…

Computer Science and Game Theory · Computer Science 2020-10-01 Daniel Halpern , Ariel D. Procaccia , Alexandros Psomas , Nisarg Shah

We provide a strategic model of the formation of production networks that subsumes the standard general equilibrium approach. The objective of firms in our setting is to choose their supply relationships so as to maximize their profit at…

Theoretical Economics · Economics 2025-05-07 Antoine Mandel , Van-Quy Nguyen , Bach Dong-Xuan

We consider a cellular system with multiple Femtocells operating in a Macrocell. They are sharing a set of communication channels. Each Femtocell has multiple users requiring certain minimum rate guarantees. Each channel has a peak power…

Computer Science and Game Theory · Computer Science 2017-03-23 V. Udaya Sankar , Vinod Sharma

We introduce the theoretical study of a Platform Equilibrium in a market with unit-demand buyers and unit-supply sellers. Each seller can join a platform and transact with any buyer or remain off-platform and transact with a subset of…

Computer Science and Game Theory · Computer Science 2024-06-24 Alon Eden , Gary Qiurui Ma , David C. Parkes

Allocation of spectrum is an important policy issue and decisions taken have ramifications for future growth of wireless communications and achieving universal connectivity. In this paper, on a common footing we compare the social welfare…

Networking and Internet Architecture · Computer Science 2013-07-23 Vijay G. Subramanian , Mike Honig , Randy Berry

Motivated by emerging resource allocation and data placement problems such as web caches and peer-to-peer systems, we consider and study a class of resource allocation problems over a network of agents (nodes). In this model, nodes can…

Computer Science and Game Theory · Computer Science 2020-01-07 S. Rasoul Etesami

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 designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We consider the classic problem of fairly allocating indivisible goods among agents with additive valuation functions and explore the connection between two prominent fairness notions: maximum Nash welfare (MNW) and envy-freeness up to any…

Computer Science and Game Theory · Computer Science 2022-09-12 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros Hollender , Alexandros A. Voudouris
‹ Prev 1 4 5 6 7 8 10 Next ›