New Query Lower Bounds for Submodular Function Minimization. - Andrei Graur; Tristan Pollner; Vidhya Ramaswamy; S. Matthew Weinberg (ITCS, 2020)

Decentralized Matching in a Probabilistic Environment. - Mobin Y. Jeloudar; Irene Lo; Tristan Pollner; Amin Saberi (EC, 2021)

Approximating Optimum Online for Capacitated Resource Allocation. - Alexander Braun; Thomas Kesselheim; Tristan Pollner; Amin Saberi (EC, 2024)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence. - Alireza AmaniHamedani; Ali Aouad; Tristan Pollner; Amin Saberi (CoRR, 2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. - Noga Alon; Nick Gravin; Tristan Pollner; Aviad Rubinstein; Hongao Wang; S. Matthew Weinberg; Qianfan Zhang 002 (CoRR, 2024)

Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. - Christos H. Papadimitriou; Tristan Pollner; Amin Saberi; David Wajc (Math. Oper. Res., 2024)

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. - Tristan Pollner; Mohammad Roghani; Amin Saberi; David Wajc (Math. Oper. Res., 2024)

Optimal item pricing in online combinatorial auctions. - José Correa 001; Andrés Cristi; Andrés Fielbaum; Tristan Pollner; S. Matthew Weinberg (Math. Program., 2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. - Noga Alon; Nick Gravin; Tristan Pollner; Aviad Rubinstein; Hongao Wang; S. Matthew Weinberg; Qianfan Zhang 002 (ITCS, 2025)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. - Mark Braverman; Mahsa Derakhshan; Tristan Pollner; Amin Saberi; David Wajc (SODA, 2025)