default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrés Cristi
Person information
- affiliation: Universidad de Chile, Santiago, Chile
- affiliation (former): EPFL, Lausanne, Switzerland
- affiliation (former): University of Chile, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]José Correa
, Andrés Cristi, Boris Epstein, José A. Soto:
Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality. Math. Oper. Res. 49(1): 441-475 (2024)- [j6]José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg:
Optimal item pricing in online combinatorial auctions. Math. Program. 206(1): 429-460 (2024) - [c16]Andrés Cristi, Sigal Oren:
Planning against a prophet: a graph-theoretic framework for making sequential decisions. EC 2024: 806 - [c15]Andrés Cristi, Bruno Ziliotto:
Prophet Inequalities Require Only a Constant Number of Samples. STOC 2024: 491-502 - [i9]Andrés Cristi, Sigal Oren:
Planning Against a Prophet: A Graph-Theoretic Framework for Making Sequential Decisions. CoRR abs/2406.13911 (2024) - [i8]Andrés Cristi, Paul Dütting, Robert Kleinberg, Renato Paes Leme:
Online Matroid Embeddings. CoRR abs/2407.10316 (2024) - [i7]José R. Correa, Andrés Cristi, Laura Vargas Koch:
The Simplicity of Optimal Dynamic Mechanisms. CoRR abs/2410.11738 (2024) - 2023
- [j5]Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. Theory Comput. Syst. 67(1): 89-124 (2023) - [c14]José Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. EC 2023: 490-510 - [c13]José Correa, Andrés Cristi:
A Constant Factor Prophet Inequality for Online Combinatorial Auctions. STOC 2023: 686-697 - [i6]José Correa, Andrés Cristi, Paul Dütting, Mohammad Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. CoRR abs/2305.15566 (2023) - [i5]Andrés Cristi, Bruno Ziliotto:
Prophet Inequalities Require Only a Constant Number of Samples. CoRR abs/2311.09141 (2023) - 2022
- [j4]José Correa, Natalie Epstein, Rafael Epstein, Juan Escobar, Ignacio Rios, Nicolas Aramayo, Bastián Bahamondes, Carlos Bonet, Martin Castillo, Andrés Cristi, Boris Epstein, Felipe Subiabre:
School Choice in Chile. Oper. Res. 70(2): 1066-1087 (2022) - [j3]José Correa, Andrés Cristi, Boris Epstein, José A. Soto:
The Two-Sided Game of Googol. J. Mach. Learn. Res. 23: 113:1-113:37 (2022) - [j2]José Correa, Andrés Cristi, Tim Oosterwijk:
On the Price of Anarchy for Flows over Time. Math. Oper. Res. 47(2): 1394-1411 (2022) - [j1]Andrés Cristi, Marc Schröder:
Negative prices in network pricing games. Oper. Res. Lett. 50(2): 99-106 (2022) - [c12]José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg:
Optimal Item Pricing in Online Combinatorial Auctions. IPCO 2022: 126-139 - 2021
- [c11]José Correa, Andrés Cristi, Paul Duetting, Ashkan Norouzi-Fard:
Fairness and Bias in Online Selection. ICML 2021: 2112-2121 - [c10]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis:
The Secretary Problem with Independent Sampling. SODA 2021: 2047-2058 - 2020
- [c9]Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk, Alkmini Sgouritsa:
A General Framework for Energy-Efficient Cloud Computing Mechanisms. AAMAS 2020: 70-78 - [c8]José R. Correa, Andrés Cristi, Boris Epstein, José A. Soto:
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities. SODA 2020: 2066-2081 - [c7]Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. STACS 2020: 42:1-42:17 - [c6]Andrés Cristi, Andreas Wiese:
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. STACS 2020: 44:1-44:14 - [i4]José Correa, Andrés Cristi, Boris Epstein, José A. Soto:
Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality. CoRR abs/2011.06516 (2020) - [i3]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis:
The Secretary Problem with Independent Sampling. CoRR abs/2011.07869 (2020)
2010 – 2019
- 2019
- [c5]José Correa, Rafael Epstein, Juan Escobar, Ignacio Rios, Bastián Bahamondes, Carlos Bonet, Natalie Epstein, Nicolas Aramayo, Martin Castillo, Andrés Cristi, Boris Epstein:
School Choice in Chile. EC 2019: 325-343 - [c4]José Correa, Andrés Cristi, Tim Oosterwijk:
On the Price of Anarchy for flows over time. EC 2019: 559-577 - [c3]Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke:
On the Complexity of Anchored Rectangle Packing. ESA 2019: 8:1-8:14 - [i2]Andrés Cristi, Marc Schröder:
Negative Prices in Network Pricing Games. CoRR abs/1904.08884 (2019) - [i1]José Correa, Andrés Cristi, Boris Epstein, José A. Soto:
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities. CoRR abs/1907.06001 (2019) - 2018
- [c2]Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis:
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - [c1]Antonios Antoniadis, Andrés Cristi:
A Near Optimal Mechanism for Energy Aware Scheduling. SAGT 2018: 31-42
Coauthor Index
aka: José R. Correa
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
