Postdoctoral Fellow
Center of Mathematical Sciences and Applications
Harvard University
tomer@cmsa.fas.harvard.edu
[ Google Scholar |
dblp ]
About
I am a postdoctoral fellow at the Center of Mathematical Sciences and Applications (CMSA) at Harvard University under the mentorship of Yannai A. Gonczarowski.
Before that, I was the
Sloan Postdoctoral Fellow at the Simons Laufer Mathematical Sciences Institute (SLMath) where I took part in the semester program on Mathematics and Computer Science of Market and Mechanism Design. Before that, I was a postdoc at Sapienza University of Rome, hosted by Stefano Leonardi.
I received my PhD from Tel Aviv University where I was advised by Michal Feldman. My research interests lie in the border of Computer Science and Economics, focusing on the analysis and design of simple mechanisms and algorithms in limited information settings.
Selected Publications
- Multi-Parameter Mechanisms for Consumer Surplus Maximization, with Daniel Schoepflin and Ariel Shaulker. STOC 2025
- Multi-Agent Contracts, with Paul Duetting, Michal Feldman and Thomas Kesselheim. STOC 2023
- Fair-Share Allocations for Agents with Arbitrary Entitlements, with Moshe Babaioff and Uriel Feige. Mathematics of Operation Research (MOR) 2023 (preliminary version in EC 2021)
- "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings, with Michal Feldman, Nick Gravin and Zhihao Gavin Tang. SODA 2023
- Prophet Matching with General Arrivals, with Michal Feldman, Nick Gravin and Zhihao Gavin Tang. Mathematics of Operation Research (MOR) 2022 (preliminary version in EC 2020)
- Combinatorial Contracts, with Paul Duetting, Michal Feldman and Thomas Kesselheim. FOCS 2021
- Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers, with Michal Feldman, Eric Neyman, Inbal Talgam-Cohen and S. Matthew Weinberg. FOCS 2019
Awards and Recognition
- Distinguished Postdoc supported by the Alfred P. Sloan Foundation, SLMath.
- Deutsch Prize, Tel Aviv University.
- Interviewed for the Postdoc Spotlight Interview Series of SLMath.
Anouncements
- On April 2nd I will be giving a talk on Algorithmic Contract Design at the Computer Science Theory at Northeastern
- On March 31st I will be giving a talk on Algorithmic Contract Design at the Theory Seminar at Boston University
- On March 28th I will be giving a talk on the Competition Complexity of Dynamic Pricing at the Member Seminar of the Center of Mathematical Sceinces and Applications at Harvard University
- Our paper "Multi-Parameter Mechanisms for Consumer Surplus Maximization" with Daniel Schoepflin and Ariel Shaulker was accepted to STOC 2025
- Our paper "Multi-Agent Combinatorial Contracts" with Paul Duetting, Michal Feldman and Thomas Kesselheim was published in SODA 2025
- Our paper "Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment" with Stefano Leonardi, Michał Pawłowski, Matteo Russo and Seeun William Umboh was published in APPROX 2024
- Our paper "Fair Division with Interdependent Values" with Georgios Birmpas, Stefano Leonardi and Matteo Russo was published in SAGT 2024
- Our paper "Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms" with Michal Feldman and Zhihao Gavin Tang was accepted to EC 2024
- Our paper "The Competition Complexity of Prophet Inequalities" with Johannes Brustle, José Correa, Paul Dütting, Michal Feldman and Victor Verdugo was accepted to EC 2024
- Our paper "On the (In)approximability of Combinatorial Contracts" with Michal Feldman and Maya Schlesinger was published in ITCS 2024
- Our paper "Pandora’s Problem with Deadlines" with Ben Berger, Michal Feldman and Federico Fusco was published in AAAI 2024