7 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.DS2023
On Maximum Bipartite Matching with Separation
Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the…
econ.TH2023★ 7 cited
Extending the Characterization of Maximum Nash Welfare
Sheung Man Yuen, Warut Suksompong
In the allocation of indivisible goods, the maximum Nash welfare rule has recently been characterized as the only rule within the class of additive welfarist rules that satisfies e…
econ.TH2023★ 7 cited
Cutting a Cake Fairly for Groups Revisited
Erel Segal-Halevi, Warut Suksompong
Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players w…