Pranav Nuti

According to our database, Pranav Nuti authored at least 9 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Stationary Online Contention Resolution Schemes.

Mohammad Reza Aminian, Rad Niazadeh, Pranav Nuti

CoRR, March, 2026

Static Pricing for Single Sample Multi-unit Prophet Inequalities.

Pranav Nuti, Peter Westbrook

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2024

Prophet Inequalities with Cancellation Costs.

Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrák

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities.

Will Ma, Calum MacRury, Pranav Nuti

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

2023

Secretary Problems: The Power of a Single Sample.

Pranav Nuti, Jan Vondrák

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Towards an Optimal Contention Resolution Scheme for Matchings.

Pranav Nuti, Jan Vondrák

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

A Tight Competitive Ratio for Online Submodular Welfare Maximization.

Amit Ganz, Pranav Nuti, Roy Schwartz

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

The Secretary Problem with Distributions.

Pranav Nuti

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2020

On the best-choice prophet secretary problem.

Pranav Nuti

CoRR, 2020