activity
20062022
most citedTractable Fragments of the Maximum Nash Welfare Problem

8 citations · 10 across the 11 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.GT2021★ 8 cited

Tractable Fragments of the Maximum Nash Welfare Problem

Jugal Garg, Edin Husić, Aniket Murhekar +1

We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of a…

math.OC2021

On Circuit Diameter Bounds via Circuit Imbalances

Daniel Dadush, Zhuan Khye Koh, Bento Natura +1

We study the circuit diameter of polyhedra, introduced by Borgwardt, Finhold, and Hemmecke (SIDMA 2015) as a relaxation of the combinatorial diameter. We show that the circuit diam…

math.CO2021

Circuit imbalance measures and linear programming

Farbod Ekbatani, Bento Natura, László A. Végh

We study properties and applications of various circuit imbalance measures associated with linear spaces. These measures describe possible ratios between nonzero entries of support…

cs.GT2021

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets

Jugal Garg, Yixin Tao, László A. Végh

We study the equilibrium computation problem in the Fisher market model with constrained piecewise linear concave (PLC) utilities. This general class captures many well-studied spe…

math.CO2021★ 1 cited

On complete classes of valuated matroids

Edin Husić, Georg Loho, Ben Smith +1

We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking…