IP Library Granted Patent US 12,219,035
Granted Patent B2
US 12,219,035 · App. 17/979,635 · Granted Feb 4, 2025

Forecasting requests based on context data for a network-based service

Inventors: Emre Demiralp (San Francisco, CA); John Mark Nickels (San Francisco, CA); Eoin O'Mahony (San Francisco, CA); Danhua Guo (San Francisco, CA); Lior Seeman (San Francisco, CA); Chaoxu Tong (San Francisco, CA); Melissa Dalis (San Francisco, CA); Hyung Jin Kim (San Francisco, CA); En Yu (San Francisco, CA); Xiangyu Sun (San Francisco, CA)
Assignee: Uber Technologies, Inc.
H04L67/63G01C5/06G01S13/882H04L67/306H04L67/51H04L67/535H04L67/62
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,219,035
App. No.
17/979,635
Granted
Feb 4, 2025
Kind
B2
Abstract

A network system can communicate with user and provider devices to facilitate the provision of a network-based service. The network system can identify optimal service providers to provide services requested by users. The network can utilize context data in matching service providers with users. In particular, the network system can determine, based on context data associated with a user, whether to perform pre-request matching for that user. A service provider who is pre-request matched with the user can be directed by the network system to relocate via a pre-request relocation direction. When the user submits the service request after the pre-request match, the network system can either automatically transmit an invitation to the pre-request matched service provider or can perform post-request matching to identify an optimal service provider for the user.

Claims (48)

1. A computing system for managing a transport service, the computing system comprising:

one or more processors; and

one or more memory resources storing instructions that, when executed by the one or more processors of the computing system, cause the computing system to perform operations that include:

receiving, over one or more networks, context data from a first user device of a first user, the context data including a current location of the first user device and application activity data corresponding to user interactions with a user application operating on the first user device;

based at least in part on the context data, determining a likelihood that the first user will transmit a service request during a lookahead period that spans a future period of time;

in response to determining the likelihood that the first user will transmit a service request during a lookahead period, determining whether a first service provider is likely to fulfill the service request if the service request is transmitted from the first user device during the lookahead period;

wherein determining whether the first service provider is likely to fulfill the service request includes determining a propensity of either of the first user or the first service provider cancelling the service request after the first service provider has accepted an invitation for the service request;

based on determining that the first service provider is likely to fulfill the service request, matching the first service provider to the first user before the service request is transmitted from the first user device;

classifying the first service provider as unavailable for matching with other users during the lookahead period;

receiving, over the one or more networks, the service request for the transport service from the first user device during the lookahead period; and

based on the service request received from the first user device during the lookahead period, transmitting, to a first provider device of the first service provider, the invitation to provide transport for the first user.

2. The computing system of claim 1 , wherein the context data further includes, for the first user device, user device sensor data or user profile data.

3. The computing system of claim 1 , wherein the context data includes data that indicates a user application is executing in a background of the first user device.

4. The computing system of claim 1 , wherein determining the likelihood that the first user will transmit the service request includes determining a machine-learned context model, the machine-learned context model being based on historical data associated with the first provider device and the context data, and wherein the operations include using the machine-learned context model in determining to perform matching for the first service provider.

5. The computing system of claim 1 , wherein matching the first service provider to the first user is based at least in part on at least one of (i) a distance between the first service provider and the first user, or (ii) an estimated time of arrival of the first service provider to a location of the first user.

6. The computing system of claim 1 , wherein determining whether the first service provider is likely to fulfill the service request incudes determining a likelihood of the service provider accepting the invitation to transport the first user.

7. The computing system of claim 6 , wherein determining whether the first service provider is likely to fulfill the service request incudes determining, a likelihood of the first service provider canceling the service request.

8. The computing system of claim 1 , wherein the operations include:

determining the future period of time spanned by the lookahead period based at least in part on the context data.

9. The computing system of claim 8 , wherein the future period of time spanned by the lookahead period is determined dynamically, so that the lookahead period is specific to the context data received from the first user device.

10. A non-transitory computer-readable medium that stores instructions for managing a transport service, which when executed by one or more processors of a computing system, cause the computing system to perform operations that include:

receiving, over one or more networks, context data from a first user device of a first user, the context data including a current location of the first user device and application activity data corresponding to user interactions with a user application operating on the first user device;

based at least in part on the context data, determining a likelihood that the first user will transmit a service request during a lookahead period that spans a future period of time;

in response to determining the likelihood that the first user will transmit a service request during a lookahead period, determining whether a first service provider is likely to fulfill the service request if the service request is transmitted from the first user device during the lookahead period;

wherein determining whether the first service provider is likely to fulfill the service request includes determining a propensity of either of the first user or the first service provider cancelling the service request after the first service provider has accepted an invitation for the service request;

based on determining that the first service provider is likely to fulfill the service request, matching the first service provider to the first user before the service request is transmitted from the first user device;

classifying the first service provider as unavailable for matching with other users during the lookahead period;

receiving, over the one or more networks, the service request for the transport service from the first user device during the lookahead period; and

based on the service request received from the first user device during the lookahead period transmitting, to a first provider device of the first service provider, the invitation to provide transport for the first user.

11. The non-transitory computer-readable medium of claim 10 , wherein the context data further includes, for the first user device, user device sensor data or user profile data.

12. The non-transitory computer-readable medium of claim 10 , wherein the context data includes data that indicates a user application is executing in a background of the first user device.

13. The non-transitory computer-readable medium of claim 10 , wherein determining the likelihood that the first user will transmit the service request includes determining a machine-learned context model, the machine-learned context model being based on historical data associated with the first provider device and the context data, and wherein the operations include using the machine-learned context model in determining to perform matching for the first service provider.

14. The non-transitory computer-readable medium of claim 10 , wherein matching the first service provider to the first user is based at least in part on at least one of (i) a distance between the first service provider and the first user, or (ii) an estimated time of arrival of the first service provider to a location of the first user.

15. The non-transitory computer-readable medium of claim 10 , wherein determining whether the first service provider is likely to fulfill the service request incudes determining a likelihood of the service provider accepting the invitation to transport the first user.

16. The non-transitory computer-readable medium of claim 15 , wherein determining whether the first service provider is likely to fulfill the service request incudes determining, a likelihood of the first service provider canceling the service request.

17. The non-transitory computer-readable medium of claim 10 , wherein the operations include:

determining the future period of time spanned by the lookahead period based at least in part on the context data.

18. The non-transitory computer-readable medium of claim 17 , wherein the future period of time spanned by the lookahead period is determined dynamically, so that the lookahead period is specific to the context data received from the first user device.

19. A computer-implemented method for managing a transport service, the method comprising:

receiving, over one or more networks, context data from a first user device of a first user, the context data including a current location of the first user device and application activity data corresponding to user interactions with a user application operating on the first user device;

based at least in part on the context data, determining a likelihood that the first user will transmit a service request during a lookahead period that spans a future period of time;

in response to determining the likelihood that the first user will transmit a service request during a lookahead period, determining whether a first service provider is likely to fulfill the service request if the service request is transmitted from the first user device during the lookahead period;

wherein determining whether the first service provider is likely to fulfill the service request includes determining a propensity of either of the first user or the first service provider cancelling the service request after the first service provider has accepted an invitation for the service request;

based on determining that the first service provider is likely to fulfill the service request, matching the first service provider to the first user before the service request is transmitted from the first user device;

classifying the first service provider as unavailable for matching with other users during the lookahead period;

receiving, over the one or more networks, the service request for the transport service from the first user device during the lookahead period; and

based on the service request received from the first user device during the lookahead period transmitting, to a first provider device of the first service provider, the invitation to provide transport for the first user.

20. The computer-implemented method of claim 19 , wherein determining the likelihood that the first user will transmit the service request includes determining a machine-learned context model, the machine-learned context model being based on historical data associated with the first provider device and the context data, and wherein the method further comprises using the machine-learned context model in determining to perform matching for the first service provider.

Continuity (2)
Continuation 16746694 · Jan 17, 2020
Related Publication 20230120345A1 · Apr 20, 2023
References Cited (307)
US 5168451A · Bolger · 1992 [cited by applicant]
US 5604676A · Penzias · 1997 [cited by applicant]
US 5945919A · Trask · 1999 [cited by applicant]
US 6212393B1 · Suarez · 2001 [cited by applicant]
US 6356838B1 · Paul · 2002 [cited by applicant]
US 6608566B1 · Davis · 2003 [cited by applicant]
US 6618593B1 · Drutman · 2003 [cited by applicant]
US 6756913B1 · Ayed · 2004 [cited by applicant]
US 6925381B2 · Adamczyk · 2005 [cited by applicant]
US 6950745B2 · Agnew · 2005 [cited by applicant]
US 6989765B2 · Gueziec · 2006 [cited by applicant]
US 7062376B2 · Oesterling · 2006 [cited by applicant]
US 7080019B1 · Hurzeler · 2006 [cited by applicant]
US 7610145B2 · Kantarjiev · 2009 [cited by applicant]
US 7822426B1 · Wuersch · 2010 [cited by applicant]
US 7886019B2 · Srinivasachar · 2011 [cited by applicant]
US 8140256B1 · dos-Santos · 2012 [cited by applicant]
US 8285571B2 · Demirdjian · 2012 [cited by applicant]
US 8362894B2 · Shah · 2013 [cited by applicant]
US 8412667B2 · Zhang · 2013 [cited by applicant]
US 8554608B1 · O'Connor · 2013 [cited by applicant]
US 8799038B2 · Chen et al. · 2014 [cited by applicant]
US 9070101B2 · Abhyanker · 2015 [cited by applicant]
US 9299255B2 · Yarnold · 2016 [cited by applicant]
US 9483744B2 · Ford · 2016 [cited by applicant]
US 9488484B2 · Ford · 2016 [cited by applicant]
US 9552559B2 · Ford · 2017 [cited by applicant]
US 9558469B2 · Ford · 2017 [cited by applicant]
US 9569740B2 · Ford · 2017 [cited by applicant]
US 9599481B2 · Ford · 2017 [cited by applicant]
US 9631933B1 · Aula · 2017 [cited by applicant]
US 9671239B2 · Ford · 2017 [cited by applicant]
US 9689694B2 · Ford · 2017 [cited by applicant]
US 9715667B2 · Ford · 2017 [cited by applicant]
US 9911170B2 · Kim · 2018 [cited by applicant]
US 9978272B2 · Lambert · 2018 [cited by applicant]
US 10074065B2 · Jones · 2018 [cited by applicant]
US 10152053B1 · Smith et al. · 2018 [cited by applicant]
US 10178890B1 · Andon · 2019 [cited by applicant]
US 10467561B2 · Haparnas · 2019 [cited by applicant]
US 10572964B2 · Kim · 2020 [cited by applicant]
US 10721327B2 · Cheng · 2020 [cited by applicant]
US 11099019B2 · Nickels · 2021 [cited by applicant]
US 11153395B2 · Sweeney · 2021 [cited by applicant]
US 11196838B2 · Cheng · 2021 [cited by applicant]
US 20010037174A1 · Dickerson · 2001 [cited by applicant]
US 20010056363A1 · Gantz · 2001 [cited by applicant]
US 20020044186A1 · Tochihara et al. · 2002 [cited by applicant]
US 20030030666A1 · Najmi · 2003 [cited by applicant]
US 20030058082A1 · Mallick · 2003 [cited by applicant]
US 20040024789A1 · Ditcharo · 2004 [cited by applicant]
US 20040049424A1 · Murray · 2004 [cited by applicant]
US 20040107110A1 · Gottlieb et al. · 2004 [cited by applicant]
US 20050153707A1 · Ledyard · 2005 [cited by applicant]
US 20060004590A1 · Khoo · 2006 [cited by applicant]
US 20060023569A1 · Agullo · 2006 [cited by applicant]
US 20060034201A1 · Umeda · 2006 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by applicant]
US 20060155460A1 · Raney · 2006 [cited by applicant]
US 20060200306A1 · Adamcyzk · 2006 [cited by applicant]
US 20060224437A1 · Gupta · 2006 [cited by applicant]
US 20060242154A1 · Rawat · 2006 [cited by applicant]
US 20070011324A1 · Mehr · 2007 [cited by applicant]
US 20070150375A1 · Yang · 2007 [cited by applicant]
US 20070255627A1 · Hallowell · 2007 [cited by applicant]
US 20070276595A1 · Lewinson · 2007 [cited by applicant]
US 20080033633A1 · Akiyoshi · 2008 [cited by applicant]
US 20080055049A1 · Weill · 2008 [cited by applicant]
US 20080091342A1 · Assael · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080270019A1 · Anderson · 2008 [cited by applicant]
US 20080270204A1 · Poykko · 2008 [cited by applicant]
US 20080277183A1 · Huang · 2008 [cited by applicant]
US 20090083111A1 · Carr · 2009 [cited by applicant]
US 20090143965A1 · Chang · 2009 [cited by applicant]
US 20090156241A1 · Staffaroni · 2009 [cited by applicant]
US 20090172009A1 · Schmith · 2009 [cited by applicant]
US 20090176508A1 · Lubeck · 2009 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20090216600A1 · Hill · 2009 [cited by applicant]
US 20090248587A1 · Van Buskirk · 2009 [cited by applicant]
US 20090281844A1 · Probst · 2009 [cited by applicant]
US 20090313077A1 · Wheeler, IV · 2009 [cited by applicant]
US 20100042549A1 · Adamczyk · 2010 [cited by applicant]
US 20100074383A1 · Lee · 2010 [cited by applicant]
US 20100205017A1 · Sichelman · 2010 [cited by applicant]
US 20100207812A1 · Demirdjian · 2010 [cited by applicant]
US 20100292914A1 · Vepsalainen · 2010 [cited by applicant]
US 20110000747A1 · Wu · 2011 [cited by applicant]
US 20110009098A1 · Kong · 2011 [cited by applicant]
US 20110099040A1 · Felt · 2011 [cited by applicant]
US 20110118981A1 · Chamlou · 2011 [cited by applicant]
US 20110145089A1 · Khunger · 2011 [cited by applicant]
US 20110153629A1 · Lehmann · 2011 [cited by applicant]
US 20110225269A1 · Yap · 2011 [cited by applicant]
US 20110238755A1 · Khan · 2011 [cited by applicant]
US 20110301985A1 · Camp · 2011 [cited by applicant]
US 20110301997A1 · Gale · 2011 [cited by applicant]
US 20110320230A1 · Podgurny · 2011 [cited by applicant]
US 20120023294A1 · Resnick · 2012 [cited by applicant]
US 20120041675A1 · Juliver · 2012 [cited by applicant]
US 20120059693A1 · Colodny et al. · 2012 [cited by applicant]
US 20120078671A1 · Mohebbi · 2012 [cited by applicant]
US 20120078672A1 · Mohebbi · 2012 [cited by applicant]
US 20120131170A1 · Spat · 2012 [cited by applicant]
US 20120203599A1 · Choi · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20120265580A1 · Kobayashi · 2012 [cited by applicant]
US 20120290950A1 · Rapaport · 2012 [cited by applicant]
US 20120311584A1 · Gruber · 2012 [cited by applicant]
US 20130024249A1 · Zohar · 2013 [cited by applicant]
US 20130054139A1 · Bodin · 2013 [cited by applicant]
US 20130054281A1 · Thakkar · 2013 [cited by applicant]
US 20130073327A1 · Edelberg · 2013 [cited by applicant]
US 20130090963A1 · Sharma · 2013 [cited by applicant]
US 20130102333A1 · Dam · 2013 [cited by applicant]
US 20130110392A1 · Kosseifi · 2013 [cited by applicant]
US 20130132140A1 · Amin · 2013 [cited by applicant]
US 20130144831A1 · Atlas · 2013 [cited by applicant]
US 20130179205A1 · Slinin · 2013 [cited by applicant]
US 20130179215A1 · Slinin · 2013 [cited by applicant]
US 20130215843A1 · Diachina · 2013 [cited by applicant]
US 20130295963A1 · Sen · 2013 [cited by applicant]
US 20130311997A1 · Gruber · 2013 [cited by applicant]
US 20140011522A1 · Lin · 2014 [cited by applicant]
US 20140051465A1 · Ruys · 2014 [cited by applicant]
US 20140067488A1 · James · 2014 [cited by applicant]
US 20140074536A1 · Meushar · 2014 [cited by applicant]
US 20140082069A1 · Varoglu · 2014 [cited by applicant]
US 20140129135A1 · Holden · 2014 [cited by applicant]
US 20140129951A1 · Amin · 2014 [cited by applicant]
US 20140149441A1 · Wang · 2014 [cited by applicant]
US 20140156556A1 · Lavian · 2014 [cited by applicant]
US 20140172727A1 · Abhyanker · 2014 [cited by applicant]
US 20140378159A1 · Dolbakian · 2014 [cited by applicant]
US 20150046080A1 · Wesselius · 2015 [cited by applicant]
US 20150154810A1 · Tew · 2015 [cited by applicant]
US 20150161554A1 · Sweeney · 2015 [cited by applicant]
US 20150161698A1 · Jones · 2015 [cited by applicant]
US 20150161752A1 · Barreto · 2015 [cited by applicant]
US 20150204684A1 · Rostamian · 2015 [cited by applicant]
US 20150219464A1 · Beaurepaire · 2015 [cited by applicant]
US 20150248689A1 · Paul · 2015 [cited by applicant]
US 20150262430A1 · Farrelly · 2015 [cited by applicant]
US 20150279217A1 · Chen · 2015 [cited by applicant]
US 20150323327A1 · Lord · 2015 [cited by applicant]
US 20150323329A1 · Ford · 2015 [cited by applicant]
US 20150323330A1 · Lord · 2015 [cited by applicant]
US 20150323331A1 · Ford · 2015 [cited by applicant]
US 20150323335A1 · Lord · 2015 [cited by applicant]
US 20150323336A1 · Lord · 2015 [cited by applicant]
US 20150324334A1 · Ford · 2015 [cited by applicant]
US 20150324717A1 · Lord · 2015 [cited by applicant]
US 20150324718A1 · Lord · 2015 [cited by applicant]
US 20150324729A1 · Lord · 2015 [cited by applicant]
US 20150324734A1 · Ford · 2015 [cited by applicant]
US 20150324945A1 · Ford · 2015 [cited by applicant]
US 20150325128A1 · Ford · 2015 [cited by applicant]
US 20150339923A1 · Konig · 2015 [cited by applicant]
US 20150345951A1 · Dutta · 2015 [cited by applicant]
US 20150356803A1 · Ellis · 2015 [cited by applicant]
US 20160019728A1 · Petrie · 2016 [cited by applicant]
US 20160026935A1 · Botea · 2016 [cited by applicant]
US 20160026936A1 · Richardson · 2016 [cited by applicant]
US 20160027306A1 · Lambert · 2016 [cited by applicant]
US 20160034828A1 · Sarawgi · 2016 [cited by applicant]
US 20160034845A1 · Hiyama · 2016 [cited by applicant]
US 20160117610A1 · Ikeda · 2016 [cited by applicant]
US 20160132792A1 · Rosnow · 2016 [cited by applicant]
US 20160138928A1 · Guo · 2016 [cited by applicant]
US 20160180346A1 · Cheng · 2016 [cited by applicant]
US 20160300318A1 · Godil · 2016 [cited by applicant]
US 20160334232A1 · Zhuang · 2016 [cited by applicant]
US 20160364678A1 · Cao · 2016 [cited by applicant]
US 20160364679A1 · Cao · 2016 [cited by applicant]
US 20160364812A1 · Cao · 2016 [cited by applicant]
US 20160364823A1 · Cao · 2016 [cited by applicant]
US 20160364824A1 · Bryant · 2016 [cited by examiner]
US 20170011324A1 · Truong · 2017 [cited by applicant]
US 20170059347A1 · Flier · 2017 [cited by applicant]
US 20170083832A1 · Williams · 2017 [cited by applicant]
US 20170126837A1 · Wang · 2017 [cited by applicant]
US 20170132540A1 · Haparnas · 2017 [cited by applicant]
US 20170138749A1 · Pan · 2017 [cited by applicant]
US 20170147951A1 · Meyer · 2017 [cited by applicant]
US 20170186126A1 · Marco · 2017 [cited by examiner]
US 20170193404A1 · Yoo · 2017 [cited by applicant]
US 20170220966A1 · Wang · 2017 [cited by applicant]
US 20170300848A1 · Shoval · 2017 [cited by applicant]
US 20170308824A1 · Lord · 2017 [cited by applicant]
US 20180003843A1 · Hori et al. · 2018 [cited by applicant]
US 20180005145A1 · Lo · 2018 [cited by applicant]
US 20180012151A1 · Wang · 2018 [cited by examiner]
US 20180060838A1 · Agrawal · 2018 [cited by applicant]
US 20180071634A1 · Carvallo · 2018 [cited by applicant]
US 20180081496A1 · Bhardwaj · 2018 [cited by examiner]
US 20180091603A1 · Nickels · 2018 [cited by applicant]
US 20180091604A1 · Yamashita · 2018 [cited by applicant]
US 20180101925A1 · Brinig · 2018 [cited by applicant]
US 20180102017A1 · Brinig · 2018 [cited by applicant]
US 20180180426A1 · Pan · 2018 [cited by applicant]
US 20180211351A1 · Kim · 2018 [cited by applicant]
US 20180268329A1 · Lord · 2018 [cited by applicant]
US 20180293521A1 · Akselrod · 2018 [cited by applicant]
US 20180339714A1 · Smid · 2018 [cited by applicant]
US 20180356239A1 · Marco · 2018 [cited by applicant]
US 20190035202A1 · Brinig · 2019 [cited by applicant]
US 20190052728A1 · Cheng · 2019 [cited by applicant]
US 20190095849A1 · Sweeney · 2019 [cited by applicant]
US 20190109910A1 · Sweeney · 2019 [cited by examiner]
US 20190205812A1 · Afzal · 2019 [cited by applicant]
US 20190206009A1 · Gibson · 2019 [cited by examiner]
US 20190221069A1 · Brinig · 2019 [cited by applicant]
US 20190244318A1 · Rajcok · 2019 [cited by examiner]
US 20190265703A1 · Hicok · 2019 [cited by applicant]
US 20190311629A1 · Sierra · 2019 [cited by applicant]
US 20200013020A1 · Yang · 2020 [cited by applicant]
US 20200145503A1 · Sweeney · 2020 [cited by applicant]
US 20200173979A1 · Nickels · 2020 [cited by applicant]
US 20200211070A1 · Singh · 2020 [cited by applicant]
US 20200258344A1 · Brinig · 2020 [cited by applicant]
US 20200272965A1 · Tanabe · 2020 [cited by applicant]
US 20200322451A1 · Cheng · 2020 [cited by applicant]
US 20200334987A1 · Shoval · 2020 [cited by applicant]
US 20210223051A1 · Hochberg · 2021 [cited by applicant]
US 20210227049A1 · Demiralp · 2021 [cited by applicant]
US 20210248520A1 · Krishnamurthy · 2021 [cited by applicant]
US 20210256437A1 · Stayner · 2021 [cited by applicant]
US 20210256794A1 · Brinig · 2021 [cited by applicant]
US 20210312338A1 · Stayner · 2021 [cited by applicant]
US 20210337047A1 · Cheng · 2021 [cited by applicant]
US 20210364302A1 · Nickels · 2021 [cited by applicant]
US 20220006870A1 · Sweeney · 2022 [cited by applicant]
US 20220114501A1 · Colon · 2022 [cited by applicant]
US 20230147033A1 · Cheng · 2023 [cited by applicant]
US 20230343167A1 · Brinig · 2023 [cited by applicant]
US 20230358552A1 · Nickels · 2023 [cited by applicant]
CA 2889853 · 2014 [cited by applicant]
CN 111832788 · 2020 [cited by applicant]
DE 10201607712 · 2016 [cited by applicant]
JP 2002133592 · 2002 [cited by applicant]
JP 2003008491A · 2003 [cited by examiner]
JP 2004302941 · 2004 [cited by applicant]
JP 2004362271 · 2004 [cited by applicant]
JP 2005107942 · 2005 [cited by applicant]
JP 2006339810 · 2006 [cited by applicant]
JP 3934985 · 2007 [cited by applicant]
JP 2014130552 · 2014 [cited by applicant]
JP 2014238831 · 2014 [cited by applicant]
JP 2004073639 · 2015 [cited by applicant]
KR 1020100053717 · 2010 [cited by applicant]
KR 1020140124137 · 2014 [cited by applicant]
KR 1020150045962 · 2015 [cited by applicant]
WO WO1999044186 · 1999 [cited by applicant]
WO WO2005013588 · 2005 [cited by applicant]
WO WO2010056199A1 · 2010 [cited by examiner]
WO WO2011067741 · 2011 [cited by applicant]
WO WO2011069170 · 2011 [cited by applicant]
WO WO2014106617 · 2014 [cited by applicant]
Hai Yang et al. “Equilibria of bilateral taxi-customer searching and meeting on networks”, Transportation Research Part B., 2010, vol. 44, pp. 1067-1083. [cited by applicant]
International Search Report in PCT/US2015/034831 dated Sep. 24, 2015. [cited by applicant]
International Search Report in PCT/US2015/043654 dated Nov. 26, 2015. [cited by applicant]
International Search report in PCT/US2016/016858 dated May 19, 2016. [cited by applicant]
IPRP in PCT/US2014/069602 dated Jun. 23, 2016. [cited by applicant]
Alfred Round, et al.: Future Ride: Adapting New Technologies to Paratransit in the United States, UC Transportation Center Berkeley, CA, UCTC No. 306 (1996). [cited by applicant]
Kikuchi, et al., “Advanced Traveler Aid Systems for Public Transportation”, US Department of Transportation, Sep. 1994. [cited by applicant]
Fu, et al., “On-Line and Off-Line Routing and Scheduling of Dial-a-Ride Paratransit Vehicles”, Computer-Aided Civil and Infrastructure Engineering 14 (1999). [cited by applicant]
International Search Report and Written Opinion issued in PCT/US2016/062344 dated Jan. 31, 2017. [cited by applicant]
Extended Search Report issued in EP 14869805.3 dated May 10, 2017. [cited by applicant]
Extended Search Report issued in EP 15826507.1 dated Nov. 10, 2017. [cited by applicant]
International Search Report in PCT/US2017/053065 dated Sep. 22, 2017. [cited by applicant]
Written Opinion issued in SG 11201700669R dated Dec. 5, 2017. [cited by applicant]
Robert Kuhlthau and Ira D. Jacobson, The Development of a Model for Predicting Passenger Acceptance of Short Haul Air Transportation Systems, NASA, Sep. 1977. [cited by applicant]
Xing Wang, Optimizing Ride Matches for Dynamic Ride Sharing Systems, GIT, May 2013. [cited by applicant]
International Search Report issued in PCT/US2017/053065 dated Dec. 13, 2017. [cited by applicant]
First Examination Report in EP 14869806.3 dated May 4, 2018. [cited by applicant]
International Search Report in PCT/US2017/053065 dated Dec. 13, 2017. [cited by applicant]
Aloizio P. Silva, A Mobile Location-Based Vehicle Fleet Management Service Application, 0-7803-78482/03 2003, IEEE. [cited by applicant]
Andersson, Magnus, Peer-to-Peer Service Sharing Platforms: Driving Share and Share Alike on a Mass-Scale, Thirty Fourth International Conference on Information Systems, Milan 2013, pp. 1-15 (2013). [cited by applicant]
First Office Action in CN 2014800731753 dated Feb. 3, 2019. [cited by applicant]
Examination Reported in AU 2017342747 dated Apr. 8, 2019. [cited by applicant]
Office Action in EP 15826501.7 dated May 14, 2019. [cited by applicant]
EESR in EP 17859424.8 dated Aug. 5, 2019. [cited by applicant]
ISR and Written Opinion in PCT/US2018/055256 dated Jan. 30, 2019. [cited by applicant]
How to request multiple Uber vehicles, Aug. 15, 2013 (https://www.wikihow.com/ Request-Multiple-Uber-Vehicles. [cited by applicant]
How to book two cabs at the same time in Uber, Jun. 30, 2017 (https://fastandclean.org/ book-two-cabs-time-uber). [cited by applicant]
Is it possible to order 2 Ubers at the same time, Jul. 13, 2015 (https://web.archive.org/ web/20150801000000*/https://android. Stackexchange.com/questions/114027/is-it- possible-to-order-2-ubers-at-the-same-time. [cited by applicant]
Written Opinion in PCT/US2018/055256 dated Jul. 19, 2019. [cited by applicant]
Examination Report No. 1 in AU 2014362392 dated Sep. 10, 2019. [cited by applicant]
Examination Report No. 1 in AU 2014362378 dated Sep. 18, 2019. [cited by applicant]
Exam Report No. 2 in AU 2017/342747 dated Aug. 27, 2019. [cited by applicant]
Second Office Action dated Sep. 27, 2019 in CN 2014800731753. [cited by applicant]
Office Action dated Apr. 16, 2020 in EP 1670690.0. [cited by applicant]
Exam Report No. 1 in AU 2015296265 dated Apr. 21, 2020. [cited by applicant]
Office Action in JP 2018-524399 dated Apr. 8, 2020. [cited by applicant]
Office Action in BR 1120170017768 dated May 6, 2020. [cited by applicant]
Exam Report No. 2 in AU 2014362378 dated May 7, 2020. [cited by applicant]
Exam Report No. 2 in AU 2015296265 dated Aug. 13, 2020. [cited by applicant]
Office Action in BR 1120180097799 dated Aug. 27, 2020. [cited by applicant]
Office Action in CA 2,932,828 dated Feb. 8, 2021. [cited by applicant]
Office Action in BR 1220200245654 dated Feb. 4, 2021. [cited by applicant]
Office Action in CA 2,956,631 dated May 7, 2021. [cited by applicant]
ISR and Written Opinion in PCT/US2021/013677 dated Jun. 16, 2021. [cited by applicant]
Office Action in CA 2,932,828 dated Jul. 23, 2021. [cited by applicant]
Office Action in AU 2021/202417 mailed Aug. 1, 2022. [cited by applicant]
Rosenblat, Alex, “Algorithmic labor and information asymmetries: A case study of Uber's drivers”, International journal of communication 10: Jul. 2016. [cited by applicant]
Constine, John, “Uber is Now Testing ‘Suggested Pickup Points’”, https://techcrunch.com/2015/07/08/ uber-suggested-pickup-points/ (Jul. 8, 2015). [cited by applicant]