Alfredo Torrico's Homepage

Submitted or Ongoing Work [W] = Working [C] = Conference Proceedings

[W3] Equitable Transit Systems under Budget Constraints (with S. Samaranayake)

Work in progress.

[W2] Revenue Maximization in Choice-based Matching Markets (with D. Nissim and D. Segev)

To be submitted. [arXiv]

[W1, C8] Stable Matching with Contingent Priorities (with F. Bobbio, M. Carvalho and I. Rios)

Submitted. Conference version: EC, 2025. [arXiv] [conference link]

Published or Under Revision [J] = Journal [C] = Conference Proceedings

[J11] Maximin Online k-Selection (with S. Perez-Salazar)

Minor revision in Operations Research.

[J10, C7] Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms (with O. El Housni and U. Hennebelle)

Operations Research, forthcoming. Conference version: IPCO, 2024 [arXiv] [conference link]

Accepted for oral presentation at MATCH-UP'24.

[J9] Multi-agent Assortment Optimization in Sequential Matching Markets (with M. Carvalho and A. Lodi)

Mathematics of Operations Research, forthcoming. [arXiv]

[J8] The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms (with I. Rios)

Manufacturing & Service Operations Management (M&SOM), 2026. [journal link]

[J7] Capacity Variation in the Many-to-One Stable Matching (with F. Bobbio, M. Carvalho and A. Lodi)

Operations Research Letters, 2026. [journal link]

[J6, C5] Capacity Planning in Stable Matching (with F. Bobbio, M. Carvalho, A. Lodi and I. Rios)

Operations Research, 2025. Conference version: EC, 2023 [journal link] [conference link]

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.

[C6] Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogota (with N. Boonsiriphatthanajaroen, N. Garg, A. Lodi, H. Mainguy)

EC, 2024. [arXiv] [conference link]

[J5] Dynamic Relaxations for Online Bipartite Matching (with A. Toriello)

INFORMS Journal on Computing, 2022. Featured Article, July/August 2022 Issue. [journal link]

[C4] Preserving Diversity when Partitioning: A Geometric Approach (with S. Perez-Salazar and V. Verdugo)

EAAMO, 2021. [conference link]

[C3] On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness (with M. Singh and S. Pokutta)

ICML, 2020. [conference link]

[J4, C2] Structured Robust Submodular Maximization: Offline and Online Algorithms (with M. Singh, S. Pokutta, N. Anari, N. Haghtalab, S. Naor)

INFORMS Journal on Computing, 2020. Conference version: AISTATS, 2019. [journal link] [conference link]

[J3, C1] A Polyhedral Approach to Online Bipartite Matching (with A. Toriello and S. Ahmed)

Mathematical Programming, 2018. Conference version: IPCO, 2016. [journal link] [conference link]

[J2] Additive Consistency of Risk Measures and its Application to Risk-averse Routing in Networks (with R. Cominetti)

Mathematics of Operations Research, 2016. [journal 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. [journal 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 Talks

Revenue Maximization in Choice-based Matching Markets. INFORMS RMP Conference (July 2025), INFORMS Annual Meeting (Oct. 2025)
Efficiency and Design Challenges in Two-sided Matching Markets. ORIE, Cornell University (May 2025).
Algorithmic Solutions for Choice-based Matching Markets. INFORMS Annual Meeting, Seattle (Oct. 2024).
Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogotá. ACM Conference on Economics and Computation (July 2024).
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms. INFORMS Optimization Society Conference (March 2024). Workshop on Combinatorial Optimization for Online Platforms (April 2024). INFORMS RMP Conference (July 2024). ISMP (July 2024).
Two-sided Assortment Optimization for Matching Markets. MIP Workshop (May 2023). SIAM Conference on Optimization (May 2023). INFORMS Annual Meeting, Phoenix (Oct. 2023).
Capacity Planning in Stable Matching. Roberto Cominetti's Fest (Jan. 2023). CMOR, Rice University (Feb. 2023)

Google Sites

Report abuse