US 12,265,928 B1
Systems and methods for matching transportation requests over extended batching windows
Orit Balicer Tsur, Palo Alto, CA (US); Vincent Chih-jye Chang, San Francisco, CA (US); Dor Levi, San Francisco, CA (US); Molly Angelica Ingles Lorenzo, San Francisco, CA (US); Keshav Eva Klementine Puranmalka, Seattle, WA (US); and Krishna Kumar Selvam, San Francisco, CA (US)
Assigned to Lyft, Inc., San Francisco, CA (US)
Filed by Lyft, Inc., San Francisco, CA (US)
Filed on Oct. 20, 2023, as Appl. No. 18/491,579.
Application 18/491,579 is a continuation of application No. 18/179,933, filed on Mar. 7, 2023, granted, now 11,829,910.
Application 18/179,933 is a continuation of application No. 16/024,349, filed on Jun. 29, 2018, granted, now 11,625,652, issued on Apr. 11, 2023.
This patent is subject to a terminal disclaimer.
Int. Cl. G06Q 10/0631 (2023.01)
CPC G06Q 10/0631 (2013.01) [G06Q 2240/00 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
entering a first transport request into a batch of transport requests including a second transport request;
determining by circuitry of a dynamic transportation matching system, an upper bound for an amount of time to monitor the batch of transport requests for potential alternative matchings for the first transport request based on a probability that a requestor associated with the first transport request will cancel the first transport request as a function of time after submitting the first transport request;
monitoring by the circuitry, the batch of transport requests within the upper bound for the amount of time; and
matching by the circuitry, a provider with the first transport request and with the second transport request based on a constraint to match the first transport request within the upper bound.