| Publication | Date of Publication | Type |
|---|
Tightness without counterexamples: a new approach and new results for prophet inequalities
Mathematics of Operations Research | 2026-06-12 | Paper |
Improved guarantees for offline stochastic matching via new ordered contention resolution schemes
Mathematics of Operations Research | 2025-11-26 | Paper |
Technical note -- leveraging the degree of dynamic substitution in assortment and inventory planning
Operations Research | 2025-07-17 | Paper |
Tight guarantees for multiunit prophet inequalities and online stochastic knapsack
Operations Research | 2025-07-17 | Paper |
On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs
Operations Research | 2025-06-05 | Paper |
Online matching frameworks under stochastic rewards, product ranking, and unknown patience
Operations Research | 2025-06-05 | Paper |
Optimizing for strategy diversity in the design of video games
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Selection and ordering policies for hiring pipelines via linear programming
Operations Research | 2024-12-20 | Paper |
| Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack | 2024-07-19 | Paper |
| Distributionally robust max flows | 2024-05-14 | Paper |
| On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs | 2024-05-14 | Paper |
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem
Operations Research | 2024-03-12 | Paper |
Designing optimization problems with diverse solutions
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
| Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals | 2023-10-16 | Paper |
Constructing demand curves from a single observation of bundle sales
Web and Internet Economics | 2023-08-04 | Paper |
Revenue-optimal deterministic auctions for multiple buyers with ordinal preferences over fixed-price items
(available as arXiv preprint) | 2023-03-21 | Paper |
Technical note -- Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources
Operations Research | 2022-09-19 | Paper |
Distributionally Robust Linear and Discrete Optimization with Marginals
Operations Research | 2022-08-05 | Paper |
| Optimizing for Strategy Diversity in the Design of Video Games | 2021-06-22 | Paper |
On policies for single-leg revenue management with limited demand information
Operations Research | 2021-06-17 | Paper |
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
Operations Research | 2021-01-19 | Paper |
Strong mixed-integer programming formulations for trained neural networks
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Separation between second price auctions with personalized reserves and the revenue optimal auction
Operations Research Letters | 2020-04-07 | Paper |
Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
Mathematics of Operations Research | 2020-03-12 | Paper |
Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
Mathematics of Operations Research | 2020-03-12 | Paper |
| Online Matching Frameworks under Stochastic Rewards, Product Ranking, and Unknown Patience | 2019-07-08 | Paper |
Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A geometric approach to combinatorial fixed-point theorems: extended abstract
(available as arXiv preprint) | 2014-06-11 | Paper |
Packing and covering triangles in planar graphs
Graphs and Combinatorics | 2010-05-05 | Paper |
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
(available as arXiv preprint) | N/A | Paper |
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
(available as arXiv preprint) | N/A | Paper |
