Abstract: The disclosed computer-implemented method may include matching transportation requests. By collecting and batching match requests over an extended period, a dynamic transportation matching system may identify more efficient matches (e.g., may match transportation requests with greater overlaps). In addition, by dynamically setting and/or extending the upper bound of time that a transportation request may remain batched with other transportation requests, the dynamic transportation matching system may account for contextual information thereby situationally improving matching efficiencies made possible with higher upper bounds while avoiding requestor dissatisfaction, lost conversions, or other inefficiencies that may result from upper bounds that are too high.

Abstract: The disclosed computer-implemented method may include matching transportation requests. By collecting and batching match requests over an extended period, a dynamic transportation matching system may identify more efficient matches (e.g., may match transportation requests with greater overlaps). In addition, by dynamically setting and/or extending the upper bound of time that a transportation request may remain batched with other transportation requests, the dynamic transportation matching system may account for contextual information thereby situationally improving matching efficiencies made possible with higher upper bounds while avoiding requestor dissatisfaction, lost conversions, or other inefficiencies that may result from upper bounds that are too high.

Abstract: The disclosed computer-implemented method may match transportation requestor devices to transportation provider devices pre-request by using the same matching process employed by a matching engine that is capable of predicting transportation swaps and walks. Multiple matches may be showcased on user devices, and offline transportation providers may see an exact match to a requestor, with an ability to go online and accept the pre-request match. Additional techniques disclosed include the curation and presentation of offers using constraint space partitioning and adjustment of price and/or the presentation of offers based on real-time information to improve the efficiency and/or utilization of transportation provider resources.

Abstract: The disclosed computer-implemented method may match transportation requestor devices to transportation provider devices pre-request by using the same matching process employed by a matching engine that is capable of predicting transportation swaps and walks. Multiple matches may be showcased on user devices, and offline transportation providers may see an exact match to a requestor, with an ability to go online and accept the pre-request match. Additional techniques disclosed include the curation and presentation of offers using constraint space partitioning and adjustment of price and/or the presentation of offers based on real-time information to improve the efficiency and/or utilization of transportation provider resources.

Abstract: The disclosed computer-implemented method may include matching transportation requests. By collecting and batching match requests over an extended period, a dynamic transportation matching system may identify more efficient matches (e.g., may match transportation requests with greater overlaps). In addition, by dynamically setting and/or extending the upper bound of time that a transportation request may remain batched with other transportation requests, the dynamic transportation matching system may account for contextual information thereby situationally improving matching efficiencies made possible with higher upper bounds while avoiding requestor dissatisfaction, lost conversions, or other inefficiencies that may result from upper bounds that are too high.