Tristan Pollner

Orcid: 0000-0002-8793-1531

According to our database1, Tristan Pollner authored at least 11 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Optimal Rounding for Two-Stage Bipartite Matching.
CoRR, October, 2025

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
A Bicriterion Concentration Inequality and Prophet Inequalities for <i>k</i>-Fold Matroid Unions.
CoRR, 2024

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence.
CoRR, 2024

Approximating Optimum Online for Capacitated Resource Allocation.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2022
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Optimal Item Pricing in Online Combinatorial Auctions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Decentralized Matching in a Probabilistic Environment.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020
New Query Lower Bounds for Submodular Function Minimization.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020


  Loading...