Tristan Pollner

Orcid: 0000-0002-8793-1531

According to our database¹, Tristan Pollner authored at least 10 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions.

[BibT_eX]

[DOI]

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Optimal item pricing in online combinatorial auctions.

[BibT_eX]

[DOI]

Math. Program., July, 2024

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy.

[BibT_eX]

[DOI]

Math. Oper. Res., 2024

Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Tristan Pollner

Amin Saberi

David Wajc

Math. Oper. Res., 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence.

[BibT_eX]

[DOI]

Alireza AmaniHamedani

Ali Aouad

Tristan Pollner

Amin Saberi

CoRR, 2024

Approximating Optimum Online for Capacitated Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2021

Decentralized Matching in a Probabilistic Environment.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

New Query Lower Bounds for Submodular Function Minimization.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Tristan Pollner

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...