25 citations · 211 across the 56 of their papers we have counts for
5 papers · 1 filter
Pandora's Problem with Combinatorial Cost
Ben Berger, Tomer Ezra, Michal Feldman +1
Pandora's problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper we initiate the study of Pandora's problem with…
Secretary Matching with General Arrivals
Tomer Ezra, Michal Feldman, Nick Gravin +1
We provide online algorithms for secretary matching in general weighted graphs, under the well-studied models of vertex and edge arrivals. In both models, edges are associated with…
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models
Tomer Ezra, Michal Feldman, Nick Gravin +1
We provide prophet inequality algorithms for online weighted matching in general (non-bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex arriv…
Prompt Scheduling for Selfish Agents
Alon Eden, Michal Feldman, Amos Fiat +1
We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic age…
Approximate Modularity Revisited
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Set functions with convenient properties (such as submodularity) appear in application areas of current interest, such as algorithmic game theory, and allow for improved optimizati…