Andrés Cristi

Orcid: 0000-0002-1227-2092

Affiliations:
  • Universidad de Chile, Santiago, Chile
  • EPFL, Lausanne, Switzerland (former)
  • University of Chile, Santiago, Chile (former)


According to our database1, Andrés Cristi authored at least 21 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal item pricing in online combinatorial auctions.
Math. Program., July, 2024

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality.
Math. Oper. Res., 2024

Online Matroid Embeddings.
CoRR, 2024

Planning Against a Prophet: A Graph-Theoretic Framework for Making Sequential Decisions.
CoRR, 2024

Prophet Inequalities Require Only a Constant Number of Samples.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Theory Comput. Syst., February, 2023

A Constant Factor Prophet Inequality for Online Combinatorial Auctions.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Trading Prophets.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Negative prices in network pricing games.
Oper. Res. Lett., 2022

On the Price of Anarchy for Flows over Time.
Math. Oper. Res., 2022

The Two-Sided Game of Googol.
J. Mach. Learn. Res., 2022

School Choice in Chile.
Oper. Res., 2022

2021
The Secretary Problem with Independent Sampling.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fairness and Bias in Online Selection.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

The Two-Sided Game of Googol and Sample-Based Prophet Inequalities.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

A General Framework for Energy-Efficient Cloud Computing Mechanisms.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
On the Complexity of Anchored Rectangle Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

School Choice in Chile.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
A Near Optimal Mechanism for Energy Aware Scheduling.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

SUPERSET: A (Super)Natural Variant of the Card Game SET.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018


  Loading...