27 citations · 32 across the 10 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Cardinality constrained submodular maximization for random streams
Paul Liu, Aviad Rubinstein, Jan Vondrak +1
We consider the problem of maximizing submodular functions in single-pass streaming and secretaries-with-shortlists models, both with random arrival order. For cardinality constrai…
cs.GT2021
The Randomized Communication Complexity of Randomized Auctions
Aviad Rubinstein, Junyao Zhao
We study the communication complexity of incentive compatible auction-protocols between a monopolist seller and a single buyer with a combinatorial valuation function over item…
cs.DS2021
Budget-Smoothed Analysis for Submodular Maximization
Aviad Rubinstein, Junyao Zhao
The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a factor. A…