Alejandro Toriello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alejandro Toriello has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
Alan L. Erera
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
8 shared publications- Sebastian Perez-Salazar
Department of Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas 77005; and Ken Kennedy Institute, Rice University, Houston, Texas 77005
7 shared publications - Mohit Singh
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
6 shared publications - Dipayan Banerjee
Quinlan School of Business, Loyola University Chicago, Chicago, Illinois 60611
4 shared publications George Nemhauser
4 shared publicationsMaged Dessouky
4 shared publications
Latest Publications
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (2) , 479-495
Batching and Greedy Policies: How Good Are They in Dynamic Matching?
Problem definition: We study a dynamic nonbipartite stochastic matching problem, where nodes appear following a type-specific independent distribution and wait in the system for a given sojourn time. This problem is motivated by applications in ride-sharing and freight transportation marketplaces and is related to other on-demand marketplaces. Methodology/results: We study the asymptotic properties of two widely used policies, batching and greedy, by analyzing a single-pair case and then converting to the general counterpart using a fluid relaxation and randomization. Finally, we present a computational study simulating freight transportation and ride-sharing marketplaces to assess the empirical effectiveness of the policies. We show that the batching policy is asymptotically optimal with respect to the sojourn time; similarly, although a straightforward greedy policy may not be optimal, a greedy policy with randomized modifications is asymptotically optimal. Perhaps more practically relevant, both policies converge exponentially fast to approximate optimality. We also extend our model to an impatient setting in which each unmatched node leaves at the end of each period with a type-dependent probability. We show that the results for the two policies still hold under different assumptions about the nodes’ patience; roughly speaking, the batching policy requires more patient nodes than the greedy policy to remain optimal. Managerial implications: Our results suggest that managers can achieve near-optimal performance by using simple greedy or batching policies, with only a reasonably small maximum waiting time guarantee, and even in the presence of potentially impatient nodes. Funding: The authors’ work was partially supported by the U.S. Office of Naval Research [Grant N00014-23-1-2631]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1074 .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (2) , 479-495
Batching and Greedy Policies: How Good Are They in Dynamic Matching?
Problem definition: We study a dynamic nonbipartite stochastic matching problem, where nodes appear following a type-specific independent distribution and wait in the system for a given sojourn time. This problem is motivated by applications in ride-sharing and freight transportation marketplaces and is related to other on-demand marketplaces. Methodology/results: We study the asymptotic properties of two widely used policies, batching and greedy, by analyzing a single-pair case and then converting to the general counterpart using a fluid relaxation and randomization. Finally, we present a computational study simulating freight transportation and ride-sharing marketplaces to assess the empirical effectiveness of the policies. We show that the batching policy is asymptotically optimal with respect to the sojourn time; similarly, although a straightforward greedy policy may not be optimal, a greedy policy with randomized modifications is asymptotically optimal. Perhaps more practically relevant, both policies converge exponentially fast to approximate optimality. We also extend our model to an impatient setting in which each unmatched node leaves at the end of each period with a type-dependent probability. We show that the results for the two policies still hold under different assumptions about the nodes’ patience; roughly speaking, the batching policy requires more patient nodes than the greedy policy to remain optimal. Managerial implications: Our results suggest that managers can achieve near-optimal performance by using simple greedy or batching policies, with only a reasonably small maximum waiting time guarantee, and even in the presence of potentially impatient nodes. Funding: The authors’ work was partially supported by the U.S. Office of Naval Research [Grant N00014-23-1-2631]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1074 .
- 21 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Submodular Dispatching with Multiple Vehicles
This distribution includes the source code to reproduce the results of the paper "Submodular Dispatching with Multiple Vehicles" by Ignacio Erazo and Alejandro Toriello, published in the INFORMS Journal of Computing. The results of the paper are provided as .pickle files, and scripts to reproduce the tables and figures are also given.
- 21 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Submodular Dispatching with Multiple Vehicles
This distribution includes the source code to reproduce the results of the paper "Submodular Dispatching with Multiple Vehicles" by Ignacio Erazo and Alejandro Toriello, published in the INFORMS Journal of Computing. The results of the paper are provided as .pickle files, and scripts to reproduce the tables and figures are also given.
- Top Cited Papers
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 51 (1) , 218-254
The I.I.D. Prophet Inequality with Limited Flexibility
In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the price frequently could be considered unfair. The literature on posted-price mechanisms and prophet inequality problems has studied the two extremes of pricing policies, the fixed-price policy and fully dynamic pricing. The former is suboptimal in revenue but is perceived as fairer than the latter. This work examines the middle situation, where there are at most k distinct prices over the selling horizon. Using the framework of prophet inequalities with independent and identically distributed random variables, we propose a new prophet inequality for strategies that use at most k thresholds. We present asymptotic results in k and results for small values of k. For k = 2 prices, we show an improvement of at least 11% over the best fixed-price solution. Moreover, k = 5 prices suffice to guarantee almost 99% of the approximation factor obtained by a fully dynamic policy that uses an arbitrary number of prices. From a technical standpoint, we use an infinite-dimensional linear program in our analysis; this formulation could be of independent interest to other online selection problems. Funding: This research was supported by the U.S. National Science Foundation [Grants CCF-2106444, CCF-1910423, and CMMI 1552479].
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 51 (1) , 218-254
Top Cited PapersThe I.I.D. Prophet Inequality with Limited Flexibility
In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the price frequently could be considered unfair. The literature on posted-price mechanisms and prophet inequality problems has studied the two extremes of pricing policies, the fixed-price policy and fully dynamic pricing. The former is suboptimal in revenue but is perceived as fairer than the latter. This work examines the middle situation, where there are at most k distinct prices over the selling horizon. Using the framework of prophet inequalities with independent and identically distributed random variables, we propose a new prophet inequality for strategies that use at most k thresholds. We present asymptotic results in k and results for small values of k. For k = 2 prices, we show an improvement of at least 11% over the best fixed-price solution. Moreover, k = 5 prices suffice to guarantee almost 99% of the approximation factor obtained by a fully dynamic policy that uses an arbitrary number of prices. From a technical standpoint, we use an infinite-dimensional linear program in our analysis; this formulation could be of independent interest to other online selection problems. Funding: This research was supported by the U.S. National Science Foundation [Grants CCF-2106444, CCF-1910423, and CMMI 1552479].
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3359-3388
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching
Trading off Waiting and Batching Many modern logistics and production systems face an inherent tension between the need to dispatch or process orders or jobs as quickly as possible and the economies of scale obtained by batching. In “Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching,” Ignacio Erazo and Alejandro Toriello propose a model that captures this tension, study various methods to optimize it or generate high-quality heuristic solutions, and assess the methods’ computational performance.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3359-3388
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching
Trading off Waiting and Batching Many modern logistics and production systems face an inherent tension between the need to dispatch or process orders or jobs as quickly as possible and the economies of scale obtained by batching. In “Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching,” Ignacio Erazo and Alejandro Toriello propose a model that captures this tension, study various methods to optimize it or generate high-quality heuristic solutions, and assess the methods’ computational performance.
- 19 August 2025
- Published by Springer Nature in Optimization Letters
- Vol. 19 (8) , 1521-1537
A semidefinite hierarchy for the expected independence number of a random graph
- 19 August 2025
- Published by Springer Nature in Optimization Letters
- Vol. 19 (8) , 1521-1537
A semidefinite hierarchy for the expected independence number of a random graph
- 1 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 50 (3) , 2226-2260
Robust Online Selection with Uncertain Offer Acceptance
Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click on displayed ads, while the platform’s algorithm may miss the users most disposed to do so. This mismatch decreases the platform’s revenue and the advertiser’s chances to reach the right customers. With this motivation, we propose a secretary problem where a candidate may or may not accept an offer according to a known probability p. Because we do not know the top candidate willing to accept an offer, the goal is to maximize a robust objective defined as the minimum over integers k of the probability of choosing one of the top k candidates, given that one of these candidates will accept an offer. Using Markov decision process theory, we derive a linear program for this max-min objective whose solution encodes an optimal policy. The derivation may be of independent interest, as it is generalizable and can be used to obtain linear programs for many online selection models. We further relax this linear program into an infinite counterpart, which we use to provide bounds for the objective and closed-form policies. For [ ], an optimal policy is a simple threshold rule that observes the first [ ] fraction of candidates and subsequently makes offers to the best candidate observed so far. Funding: Financial support from the U.S. National Science Foundation [Grants CCF-2106444, CCF-1910423, and CMMI 1552479] is gratefully acknowledged.
- 1 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 50 (3) , 2226-2260
Robust Online Selection with Uncertain Offer Acceptance
Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click on displayed ads, while the platform’s algorithm may miss the users most disposed to do so. This mismatch decreases the platform’s revenue and the advertiser’s chances to reach the right customers. With this motivation, we propose a secretary problem where a candidate may or may not accept an offer according to a known probability p. Because we do not know the top candidate willing to accept an offer, the goal is to maximize a robust objective defined as the minimum over integers k of the probability of choosing one of the top k candidates, given that one of these candidates will accept an offer. Using Markov decision process theory, we derive a linear program for this max-min objective whose solution encodes an optimal policy. The derivation may be of independent interest, as it is generalizable and can be used to obtain linear programs for many online selection models. We further relax this linear program into an infinite counterpart, which we use to provide bounds for the objective and closed-form policies. For [ ], an optimal policy is a simple threshold rule that observes the first [ ] fraction of candidates and subsequently makes offers to the best candidate observed so far. Funding: Financial support from the U.S. National Science Foundation [Grants CCF-2106444, CCF-1910423, and CMMI 1552479] is gratefully acknowledged.
- Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 511
Cooperation and the Design of Public Goods
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 511
Open AccessCooperation and the Design of Public Goods
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (2) , 279-300
Pricing and Demand Management for Integrated Same-Day and Next-Day Delivery Systems
We study a system in which a common delivery fleet provides service to both same-day delivery (SDD) and next-day delivery (NDD) orders placed by e-retail customers who are sensitive to delivery prices. We develop a model of the system and optimize with respect to two separate objectives. First, empirical research suggests that fulfilling e-retail orders ahead of promised delivery days increases a firm’s long-run market share. Motivated by this phenomenon, we optimize for customer satisfaction by maximizing the quantity of NDD orders fulfilled one day early given fixed prices. Next, we optimize for total profit; we optimize for a single SDD price, and we then set SDD prices in a two-level scheme with discounts for early-ordering customers. Our analysis relies on continuous approximation techniques to capture the interplay between NDD and SDD orders and particularly the effect one day’s operations have on the next, a novel modeling component not present in SDD-only models; a key technical result is establishing the model’s convergence to a steady state using dynamical systems theory. We derive structural insights and efficient algorithms for both objectives. In particular, we show that, under certain conditions, the total profit is a piecewise-convex function with polynomially many breakpoints that can be efficiently enumerated. In a case study set in metropolitan Denver, Colorado, approximately 10% of NDD orders can be fulfilled one day early at optimality, and profit is increased by 1% to 3% in a two-level pricing scheme versus a one-level scheme. We conduct operational simulations for validation of solutions and analysis of initial conditions. History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023. Funding: This work was supported by the National Science Foundation [Grant DGE-1650044]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0381 .
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (2) , 279-300
Pricing and Demand Management for Integrated Same-Day and Next-Day Delivery Systems
We study a system in which a common delivery fleet provides service to both same-day delivery (SDD) and next-day delivery (NDD) orders placed by e-retail customers who are sensitive to delivery prices. We develop a model of the system and optimize with respect to two separate objectives. First, empirical research suggests that fulfilling e-retail orders ahead of promised delivery days increases a firm’s long-run market share. Motivated by this phenomenon, we optimize for customer satisfaction by maximizing the quantity of NDD orders fulfilled one day early given fixed prices. Next, we optimize for total profit; we optimize for a single SDD price, and we then set SDD prices in a two-level scheme with discounts for early-ordering customers. Our analysis relies on continuous approximation techniques to capture the interplay between NDD and SDD orders and particularly the effect one day’s operations have on the next, a novel modeling component not present in SDD-only models; a key technical result is establishing the model’s convergence to a steady state using dynamical systems theory. We derive structural insights and efficient algorithms for both objectives. In particular, we show that, under certain conditions, the total profit is a piecewise-convex function with polynomially many breakpoints that can be efficiently enumerated. In a case study set in metropolitan Denver, Colorado, approximately 10% of NDD orders can be fulfilled one day early at optimality, and profit is increased by 1% to 3% in a two-level pricing scheme versus a one-level scheme. We conduct operational simulations for validation of solutions and analysis of initial conditions. History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023. Funding: This work was supported by the National Science Foundation [Grant DGE-1650044]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0381 .
- 21 January 2025
- Published by Elsevier in Operations Research Letters
- Vol. 59
On linear threshold policies for continuous-time dynamic yield management
- 21 January 2025
- Published by Elsevier in Operations Research Letters
- Vol. 59
On linear threshold policies for continuous-time dynamic yield management
- 11 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 168
Distributionally robust disaster relief planning under the Wasserstein set
- 11 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 168
Distributionally robust disaster relief planning under the Wasserstein set