SUPERSET: A (Super)Natural Variant of the Card Game SET. - Fábio Botler; Andrés Cristi; Ruben Hoeksma; Kevin Schewior; Andreas Tönnis (FUN, 2018)

A Near Optimal Mechanism for Energy Aware Scheduling. - Antonios Antoniadis 001; Andrés Cristi (SAGT, 2018)

School Choice in Chile. - José Correa 001; Rafael Epstein; Juan Escobar; Ignacio Rios; Bastián Bahamondes; Carlos Bonet; Natalie Epstein; Nicolas Aramayo; Martin Castillo; Andrés Cristi; Boris Epstein 001 (EC, 2019)

On the Complexity of Anchored Rectangle Packing. - Antonios Antoniadis 001; Felix Biermeier; Andrés Cristi; Christoph Damerius; Ruben Hoeksma; Dominik Kaaser; Peter Kling; Lukas Nölke (ESA, 2019)

A General Framework for Energy-Efficient Cloud Computing Mechanisms. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (AAMAS, 2020)

The Two-Sided Game of Googol and Sample-Based Prophet Inequalities. - José R. Correa; Andrés Cristi; Boris Epstein 001; José A. Soto (SODA, 2020)

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. - Andrés Cristi; Andreas Wiese (STACS, 2020)

Fairness and Bias in Online Selection. - José Correa 001; Andrés Cristi; Paul Duetting; Ashkan Norouzi-Fard (ICML, 2021)

School Choice in Chile. - José Correa 001; Natalie Epstein; Rafael Epstein; Juan Escobar; Ignacio Rios; Nicolas Aramayo; Bastián Bahamondes; Carlos Bonet; Martin Castillo; Andrés Cristi; Boris Epstein 001; Felipe Subiabre (Oper. Res., 2022)

The Two-Sided Game of Googol. - José Correa 001; Andrés Cristi; Boris Epstein 001; José A. Soto (J. Mach. Learn. Res., 2022)

On the Price of Anarchy for Flows over Time. - José Correa 001; Andrés Cristi; Tim Oosterwijk (Math. Oper. Res., 2022)

Negative prices in network pricing games. - Andrés Cristi; Marc Schröder 002 (Oper. Res. Lett., 2022)

Trading Prophets. - José Correa 001; Andrés Cristi; Paul Duetting; MohammadTaghi Hajiaghayi; Jan Olkowski; Kevin Schewior (EC, 2023)

A Constant Factor Prophet Inequality for Online Combinatorial Auctions. - José Correa 001; Andrés Cristi (STOC, 2023)

Fixed-Parameter Algorithms for Unsplittable Flow Cover. - Andrés Cristi; Mathieu Mari; Andreas Wiese (Theory Comput. Syst., 2023)

Planning against a prophet: a graph-theoretic framework for making sequential decisions. - Andrés Cristi; Sigal Oren (EC, 2024)

Prophet Inequalities Require Only a Constant Number of Samples. - Andrés Cristi; Bruno Ziliotto (STOC, 2024)

Online Matroid Embeddings. - Andrés Cristi; Paul Dütting; Robert Kleinberg; Renato Paes Leme (CoRR, 2024)

The Simplicity of Optimal Dynamic Mechanisms. - José R. Correa; Andrés Cristi; Laura Vargas Koch (CoRR, 2024)

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality. - José Correa 001; Andrés Cristi; Boris Epstein 001; José A. Soto (Math. Oper. Res., 2024)

Optimal item pricing in online combinatorial auctions. - José Correa 001; Andrés Cristi; Andrés Fielbaum; Tristan Pollner; S. Matthew Weinberg (Math. Program., 2024)

Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume. - Andrés Cristi; David Salas (IPCO, 2025)

The Secretary Problem with Independent Sampling. - José Correa 001; Andrés Cristi; Laurent Feuilloley; Tim Oosterwijk; Alexandros Tsigonias-Dimitriadis (Manag. Sci., 2025)

Competitive mechanisms for energy-efficient cloud computing. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (Theor. Comput. Sci., 2025)