Submitted and Ongoing Work
Equitable Transit Systems under Resource Constraints (with S. Samaranayake)
In progress.
Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogota (with N. Boonsiriphatthanajaroen, N. Garg, A. Lodi, H. Mainguy)
Submitted.
Stable Matching with Contingent Priorities (with F. Bobbio, M. Carvalho and I. Rios)
Submitted.
Accepted for poster presentation at EAAMO'23.
Maximin Online k-Selection (with S. Perez-Salazar)
Submitted.
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms (with O. El Housni and U. Hennebelle)
Submitted. [preprint]
Supersedes [C6] below.
Platform Design in Matching Markets: A Two-sided Assortment Optimization Approach (with I. Rios)
To be submitted. [preprint]
Capacity Variation in the Many-to-One Stable Matching (with F. Bobbio, M. Carvalho and A. Lodi)
To be submitted. [preprint]
Multi-agent Assortment Optimization in Sequential Matching Markets (with M. Carvalho and A. Lodi)
Submitted. [preprint]
Accepted for oral presentation in the 3rd INFORMS Workshop on Market Design at EC'21.
Capacity Planning in Stable Matching (with F. Bobbio, M. Carvalho, A. Lodi and I. Rios)
Major revision in Operations Research. [preprint]
Supersedes [C5] below.
Federico was awarded Runner-up in the Student Paper Competition at the 2023 Canadian OR Society Conference.
Accepted for oral presentations at EAAMO'22 and MATCH-UP'22.
Journal Papers
[J5] Dynamic Relaxations for Online Bipartite Matching (with A. Toriello)
INFORMS Journal on Computing, 2022. Featured Article, July/August 2022 Issue. [link]
[J4] Structured Robust Submodular Maximization: Offline and Online Algorithms (with M. Singh, S. Pokutta, N. Anari, N. Haghtalab, S. Naor)
INFORMS Journal on Computing, 2020. [link]
Supersedes [C2] below.
[J3] A Polyhedral Approach to Online Bipartite Matching (with A. Toriello and S. Ahmed)
Mathematical Programming, 2018. [link]
Supersedes [C1] below.
[J2] Additive Consistency of Risk Measures and its Application to Risk-averse Routing in Networks (with R. Cominetti)
Mathematics of Operations Research, 2016. [link]
[J1] Dynamical Modelling and Optimal Control of Landfills (with A. Rapaport, T. Bayen, M. Sebbah, A. Donoso-Bravo)
Mathematical Methods and Models in Applied Sciences (M3AS), 2016. [link]
Peer-reviewed Conference Papers
[C6] Adaptivity Gaps in Two-sided Assortment Optimization (with O. El Housni and U. Hennebelle)
To appear in Proceedings of IPCO'24.
[C5] Capacity Planning in Stable Matching: An Application to School Choice (with F. Bobbio, M. Carvalho, A. Lodi and I. Rios)
In Proceedings of EC'23. [link]
[C4] Preserving Diversity when Partitioning: A Geometric Approach (with S. Perez-Salazar and V. Verdugo)
In Proceedings of EAAMO'21. [link]
[C3] On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness (with M. Singh and S. Pokutta)
In Proceedings of ICML'20. [link]
[C2] Structured Robust Submodular Maximization: Offline and Online Algorithms (with M. Singh, S. Pokutta, N. Anari, N. Haghtalab, S. Naor)
In Proceedings of AISTATS’19. [link]
[C1] A Polyhedral Approach to Online Bipartite Matching (with A. Toriello and S. Ahmed)
In Proceedings of IPCO’16. [link]
Theses
Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. Ph.D. Thesis, Georgia Institute of Technology, 2019.
Risk measures and their application to risk-averse routing in networks (in Spanish). Mathematical Engineering Thesis, Universidad de Chile, 2013.
Selected Previous Talks
Two-sided Assortment Optimization for Matching Markets. MIP Workshop (May 2023). SIAM Conference on Optimization (May 2023).
Capacity Planning in Stable Matching. Roberto Cominetti's Fest (Jan. 2023). CMOR, Rice University (Feb. 2023)
Preserving Diversity when Partitioning. 3rd Games, Agents, and Incentives Workshop at AAMAS'22. DS4DM Coffee Talks (May 2022). INFORMS Annual Meeting, Indianapolis (Oct. 2022).
The Role of Subset Selection in Matching Markets. USC, Marshall (Jan. 2022). Ohio State U., ISE (Feb. 2022). GERAD (Feb. 2022). UPitt, IE (March 2022).
Multi-agent Assortment Optimization in Sequential Matching Markets. INFORMS Workshop on Market Design (July 2021). Poster session, Young Researchers Workshop, Cornell ORIE (October 2021). INFORMS Annual Meeting (October 2021). DIRO Colloque, University of Montreal (December 2021).
The Greedy Algorithm: An Effective and Flexible Tool in Submodular Optimization. Discrete Optimization Talks (December 2020), Workshop, DII Uchile (January 2020).
Greedy Adapts to Sharpness. YinzOR, CMU (August 2019). YINS Seminar Series, Yale University (April 2019). Ph.D Student Seminar, ISyE Gatech (April 2019). ICML, Virtual (2020). Seminario DIIO, UAI Chile (November 2020).