1 citations · 2 across the 11 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Dynamic Contention Resolution Schemes
Moran Feldman, Gregory Kehne, Roie Levin +1
We introduce a low-recourse rounding paradigm for packing problems in fully dynamic settings, which we name Dynamic Contention Resolution Schemes (DCRSs). These are dynamic analogs…
cs.GT2026
Proportionality from Sampled Approvals
Gregory Kehne
How much voter input is necessary in order to ensure representation in multiwinner elections? If voters are randomly selected from an underlying population, how many draws are nece…