
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
We study the problem of approximating maximum Nash social welfare (NSW) ...
read it

Weighted Maxmin Fair Share Allocation of Indivisible Chores
We initiate the study of indivisible chore allocation for agents with as...
read it

Pipeline Interventions
We introduce the pipeline intervention problem, defined by a layered dir...
read it

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
We present the first nontrivial approximation algorithm for the bottlene...
read it

A Spectral Approach to Network Design
We present a spectral approach to design approximation algorithms for ne...
read it

Validator election in nominated proofofstake
Polkadot is a decentralized blockchain platform to be launched in 2020. ...
read it

Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each ...
read it
Approximating Nash Social Welfare under Rado Valuations
We consider the problem of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible items to n agents. The NSW is a popular objective that provides a balanced tradeoff between the often conflicting requirements of fairness and efficiency, defined as the weighted geometric mean of agents' valuations. For the symmetric additive case of the problem, where agents have the same weight with additive valuations, the first constantfactor approximation algorithm was obtained in 2015. This led to a flurry of work obtaining constantfactor approximation algorithms for the symmetric case under mild generalizations of additive, and O(n)approximation algorithms for more general valuations and for the asymmetric case. In this paper, we make significant progress towards both symmetric and asymmetric NSW problems. We present the first constantfactor approximation algorithm for the symmetric case under Rado valuations. Rado valuations form a general class of valuation functions that arise from maximum cost independent matching problems, including as special cases assignment (OXS) valuations and weighted matroid rank functions. Furthermore, our approach also gives the first constantfactor approximation algorithm for the asymmetric case under Rado valuations, provided that the maximum ratio between the weights is bounded by a constant.
READ FULL TEXT
Comments
There are no comments yet.