2 citations · 4 across the 11 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
Simple and Optimal Greedy Online Contention Resolution Schemes
Vasilis Livanos
Real-world problems such as ad allocation and matching have been extensively studied under the lens of combinatorial optimization. In several applications, uncertainty in the input…
cs.DS2021★ 2 cited
On Submodular Prophet Inequalities and Correlation Gap
Chandra Chekuri, Vasilis Livanos
Prophet inequalities and secretary problems have been extensively studied in recent years due to their elegance, connections to online algorithms, stochastic optimization, and mech…