-
1.
公开(公告)号:US20200005205A1
公开(公告)日:2020-01-02
申请号:US16024349
申请日:2018-06-29
Applicant: Lyft, Inc.
Inventor: Orit Balicer Tsur , Vincent Chih-jye Chang , Dor Levi , Molly Angelica Ingles Lorenzo , Keshav Puranmalka , Krishna Kumar Selvam
IPC: G06Q10/06
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. Furthermore, by providing a notification interface for a transportation requestor device that notifies the requestor when to be ready, a transportation matching application may provide a positive requestor experience while allowing for longer match windows. Various other methods, systems, and computer-readable media are also disclosed.
-
公开(公告)号:US20230316159A1
公开(公告)日:2023-10-05
申请号:US17810708
申请日:2022-07-05
Applicant: Lyft, Inc.
Inventor: Michael Scott Bishoff , Andrew Bruce Holbrook , Arman Jabbari , Simon Jack Jenkins , David Bruce Lindsay , Ding Luo , Nathan Patrick Green McCloskey , Keshav Puranmalka , Guy-Baptiste Richard de Capele d'Hautpoul
CPC classification number: G06Q10/02 , G06Q10/06316 , H04W4/021 , G06Q50/30
Abstract: This disclosure describes an airport priority matching system that can utilize computer implemented models to dynamically match provider devices and priority requester devices in response to time priority airport transportation requests. In particular, in one or more embodiments the airport priority matching system identifies, utilizing global positioning data, provider devices within an airport boundary region and determines time metrics relative to an airport pickup location and/or a ranking order corresponding to an airport provider device tiered staging location. Moreover, prior to receiving a time priority airport transportation request, the airport priority matching system reserves a set of provider devices for airport time priority services based on the plurality of time metrics and/or the ranking order. Further, in response to receiving the time priority airport transportation request, the airport priority matching system selects a provider device from a pool of available provider devices to match to a priority requester device.
-
公开(公告)号:US20220084155A1
公开(公告)日:2022-03-17
申请号:US17020443
申请日:2020-09-14
Applicant: Lyft, Inc.
Inventor: Adriel Samuel Frederick , Simon Jack Jenkins , Ryan Lok Yan Ma , Keshav Puranmalka , Pratik Hirachand Shah , Jessica Kelly T Talbert , Rebecca Lindsay Blum , Mayank Gulati
Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for dynamically matching requestor devices to generate efficient transportation groups that satisfy user-selected arrival deadlines. In particular, in one or more embodiments, the disclosed systems generate timeslots corresponding to a transportation request including pick-up times, arrival deadlines, and transportation values. In response to receiving user selections of timeslots, the disclosed systems can partition requestor devices into sets of requestor devices. Additionally, the disclosed systems can utilize the sets of requestor devices to match compatible requestor devices to both maximize system efficiency and satisfy selected arrival deadlines for each requestor device.
-
公开(公告)号:US12277619B2
公开(公告)日:2025-04-15
申请号:US17020443
申请日:2020-09-14
Applicant: Lyft, Inc.
Inventor: Adriel Samuel Frederick , Simon Jack Jenkins , Ryan Lok Yan Ma , Keshav Puranmalka , Pratik Hirachand Shah , Jessica Kelly T Talbert , Rebecca Lindsay Blum , Mayank Gulati
IPC: G06Q50/40 , G06Q10/1093
Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for dynamically matching requestor devices to generate efficient transportation groups that satisfy user-selected arrival deadlines. In particular, in one or more embodiments, the disclosed systems generate timeslots corresponding to a transportation request including pick-up times, arrival deadlines, and transportation values. In response to receiving user selections of timeslots, the disclosed systems can partition requestor devices into sets of requestor devices. Additionally, the disclosed systems can utilize the sets of requestor devices to match compatible requestor devices to both maximize system efficiency and satisfy selected arrival deadlines for each requestor device.
-
公开(公告)号:US11625652B2
公开(公告)日:2023-04-11
申请号:US16024349
申请日:2018-06-29
Applicant: Lyft, Inc.
Inventor: Orit Balicer Tsur , Vincent Chih-jye Chang , Dor Levi , Molly Angelica Ingles Lorenzo , Keshav Puranmalka , Krishna Kumar Selvam
IPC: G06Q10/06 , G06Q10/0631
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. Furthermore, by providing a notification interface for a transportation requestor device that notifies the requestor when to be ready, a transportation matching application may provide a positive requestor experience while allowing for longer match windows. Various other methods, systems, and computer-readable media are also disclosed.
-
6.
公开(公告)号:US20220076170A1
公开(公告)日:2022-03-10
申请号:US17014788
申请日:2020-09-08
Applicant: Lyft, Inc.
Inventor: Michael Kae-Uei Chang , David Florian Kayode Ikuye , Keshav Puranmalka , Dan Xiaoyu Yu , Conglei Zhang
Abstract: The present disclosure relates to systems, non-transitory computer readable media, and methods that provide graphical user interfaces comprising future transportation options with varying time windows at different transportation values and dynamically analyze the time windows to identify provider devices to fulfill transportation requests based on provider device efficiency metrics. For instance, the disclosed systems can delay selection of a provider device within a future time window utilizing a dynamic threshold provider device efficiency metric. For instance, the disclosed systems can analyze historical distributions of provider devices to generate a transition probability matrix that is utilized to analyze current provider devices and determine a threshold provider device efficiency metric that reflects the likelihood of identifying more efficient matches in the future. The disclosed systems can compare the determined threshold to anticipated efficiency metrics for individual provider devices to generate matches for digital transportation requests.
-
公开(公告)号:US20210142243A1
公开(公告)日:2021-05-13
申请号:US16681185
申请日:2019-11-12
Applicant: Lyft, Inc.
Inventor: Jimmy Young , Mohammad Ali Motie Share , Humboldt Jayme Ramirez , Alex Collier Mazure, IV , Anna Pan , Keshav Puranmalka , Neil Rajiv Chainani , Michael Scott Bishoff , Mallory Jackson Paine , Dan Xiaoyu Yu , Assaf Haim Shalev , Bao Kham Chau
Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for intelligently determining to assess (or not assess) a cancellation penalty and notifying a requestor device of such a penalty in response to either a requestor's selection to cancel a single transportation request for a requestor or a requestor's selection to cancel a shared-transportation request associated with multiple requestors. For example, the disclosed systems can generate conversion probabilities for a requestor reflecting if a cancellation penalty is assessed—and if the cancellation penalty is not assessed—for a cancellation of a transportation request for transport of a lone requestor. Based on the conversion probabilities, the disclosed systems customize a cancellation notice for a requestor device to either include or exclude the cancellation penalty. Additionally, or alternatively, in certain implementations, the disclosed systems generate a transportation efficiency metric for modifying a projected transportation route for a shared transportation to account for a cancellation of a shared-transportation request. Based on the transportation efficiency metric, the disclosed systems customize a cancellation notice for a requestor device to either include or exclude the cancellation penalty.
-
-
-
-
-
-