8 citations · 13 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 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…
cs.GT2012
LP-based Covering Games with Low Price of Anarchy
Georgios Piliouras, Tomas Valla, Laszlo A. Vegh
We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimizati…