48 citations · 282 across the 41 of their papers we have counts for
6 papers · 1 filter
Deterministic Algorithms for Submodular Maximization Problems
Niv Buchbinder, Moran Feldman
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function max…
Online Contention Resolution Schemes
Moran Feldman, Ola Svensson, Rico Zenklusen
We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context…
The Submodular Secretary Problem Goes Linear
Moran Feldman, Rico Zenklusen
During the last decade, the matroid secretary problem (MSP) became one of the most prominent classes of online selection problems. Partially linked to its numerous applications in…
Building a Good Team: Secretary Problems and the Supermodular Degree
Moran Feldman, Rani Izsak
In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether…
Online Submodular Maximization with Preemption
Niv Buchbinder, Moran Feldman, Roy Schwartz
Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study…
Mechanism Design with Strategic Mediators
Moshe Babaioff, Moran Feldman, Moshe Tennenholtz
We consider the problem of designing mechanisms that interact with strategic agents through strategic intermediaries (or mediators), and investigate the cost to society due to the…