139 citations · 615 across the 107 of their papers we have counts for
12 papers · 1 filter
Stable Matching with Ties: Approximation Ratios and Learning
Shiyun Lin, Simon Mauras, Nadav Merlis +1
We study matching markets with ties, where workers on one side of the market may have tied preferences over jobs, determined by their matching utilities. Unlike classical two-sided…
Prophet Inequalities: Competing with the Top Items is Easy
Mathieu Molina, Nicolas Gast, Patrick Loiseau +1
We explore a prophet inequality problem, where the values of a sequence of items are drawn i.i.d. from some distribution, and an online decision maker must select one item irrevoca…
Optimal Unimodular Matching
Nathanaël Enriquez, Mike Liu, Laurent Ménard +1
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings…
Calibrated Forecasting and Persuasion
Atulya Jain, Vianney Perchet
We study a dynamic game where an expert sends probabilistic forecasts to a decision-maker. The decision-maker verifies these forecasts using a calibration test based on past data.…
Improved Algorithms for Contextual Dynamic Pricing
Matilde Tullii, Solenne Gaucher, Nadav Merlis +1
In contextual dynamic pricing, a seller sequentially prices goods based on contextual information. Buyers will purchase products only if the prices are below their valuations. The…
Lookback Prophet Inequalities
Ziyad Benomar, Dorian Baudry, Vianney Perchet
Prophet inequalities are fundamental optimal stopping problems, where a decision-maker observes sequentially items with values sampled independently from known distributions, and m…