5 citations · 5 across the 1 of their papers we have counts for
3 papers
cs.GT2020
Indivisible Mixed Manna: On the Computability of MMS + PO Allocations
Rucha Kulkarni, Ruta Mehta, Setareh Taki
In this paper we initiate the study of finding fair and efficient allocations of an indivisible mixed manna: Divide m indivisible items among n agents under the fairness notion of…
cs.GT2019★ 5 cited
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Jugal Garg, Pooja Kulkarni, Rucha Kulkarni
We study the problem of approximating maximum Nash social welfare (NSW) when allocating m indivisible items among n asymmetric agents with submodular valuations. The NSW is a well-…
cs.CC2018
Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Shant Boodaghians, Rucha Kulkarni, Ruta Mehta
Worst-case hardness results for most equilibrium computation problems have raised the need for beyond-worst-case analysis. To this end, we study the smoothed complexity of finding…