Tristan Pollner

I am a fifth-year Ph.D. student at Stanford University, fortunate to be advised by Amin Saberi.  My research is on algorithm design in uncertain environments, with applications ranging from organ allocation to ride-hailing to online advertisement. 

Papers

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence (submitted)

Ali Aouad, Alireza Amanihamedani, Tristan Pollner, Amin Saberi

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling (SODA 2025)

Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc


A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions (ITCS 2025)

Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, S. Matthew Weinberg, Hongao Wang, Qianfan Zhang


Approximating Optimum Online for Capacitated Resource Allocation (EC 2024)

Alexander Braun, Thomas Kesselheim, Tristan Pollner, Amin Saberi

Online stochastic max-weight bipartite matching: Beyond prophet inequalities (Math of OR 2023, EC 2021)

Christos Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc

Improved online contention resolution for matchings and applications to the gig economy (Math of OR 2023, EC 2022)

Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc

Optimal item pricing in online combinatorial auctions (IPCO 2022)

José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg

Decentralized Matching in a Probabilistic Environment (EC 2021)

Mobin Y Jeloudar, Irene Lo, Tristan Pollner, Amin Saberi

New query lower bounds for submodular function minimization (ITCS 2020)

Andrei Graur, Vidhya Ramaswamy, Tristan Pollner, S. Matthew Weinberg

Teaching

MS&E 232: Introduction to Game Theory

MS&E 319: Matching Theory

MS&E 212: Mathematical Programming and Combinatorial Optimization 


Student Testimonials