activity
20172023
most citedDividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

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

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

Karl Bringmann, Bhaskar Ray Chaudhury

We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size . For the problem of deciding whether the LCS of…

cs.GT2018

Combinatorial Algorithms for General Linear Arrow-Debreu Markets

Bhaskar Ray Chaudhury, Kurt Mehlhorn

We present a combinatorial algorithm for determining the market clearing prices of a general linear Arrow-Debreu market, where every agent can own multiple goods. The existing comb…