6 citations · 16 across the 24 of their papers we have counts for
4 papers · 1 filter
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
Tomer Ezra, Stefano Leonardi, Michał Pawłowski +2
The online joint replenishment problem (JRP) is a fundamental problem in the area of online problems with delay. Over the last decade, several works have studied generalizations of…
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…