Skip to content

Author

Michal Feldman

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Optimal Online Stochastic Matching

We resolve the problem of unweighted online stochastic matching with a known arrival law by establishing its optimal competitive ratio. For Poisson arrivals, we achieve $1-e/e^e\approx0.8206$, matching the upper bound of Chierichetti, Giacchini, Panconesi, and Vattani [ICALP 2025]. For exactly $n$ i.i.d.~arrivals, we o...

Paul Duetting, Michal Feldman, Mathieu Molina · 0 citations
Preprint Sep 2026

Fair Prophets

We initiate the study of $\alpha$-fair prophet inequalities. This interpolates between utilitarian welfare $(\alpha=0)$, Nash welfare $(\alpha=1)$, and Rawlsian max-min fairness $(\alpha\to\infty)$. Given the non-linearity of the objective, it matters when the expectation is applied. For instance, for the Rawlsian obje...

Paul Duetting, Michal Feldman, Mathieu Molina · 0 citations
Sep 2026

Settling the Complexity Landscape of Multi-Agent Contracts with Binary Actions

We study the computational complexity of optimal contract design in the multi-agent binary-action model, focusing on gross-substitutes reward functions and related classes. While additive rewards admit an FPTAS and general submodular rewards admit only constant-factor approximation, the complexity within the intermedia...

Michal Feldman, Maya Schlesinger, S. Shani · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.