Prosecution Insights
Last updated: November 20, 2026
Application No. 16/790,426

Optimization of Delivery Associate Incentives

Final Rejection §101§103
Filed
Feb 13, 2020
Examiner
PRASAD, NANCY N
Art Unit
3624
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
DoorDash Inc.
OA Round
10 (Final)
21%
Grant Probability
At Risk
11-12
OA Rounds
0m
Est. Remaining
40%
With Interview

Examiner Intelligence

Grants only 21% of cases
21%
Career Allowance Rate
71 granted / 333 resolved
-30.7% vs TC avg
Strong +19% interview lift
Without
With
+18.9%
Interview Lift
resolved cases with interview
Typical timeline
5y 3m
Avg Prosecution
28 currently pending
Career history
377
Total Applications
across all art units

Statute-Specific Performance

§101
39.5%
-0.5% vs TC avg
§103
46.0%
+6.0% vs TC avg
§102
3.2%
-36.8% vs TC avg
§112
9.5%
-30.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 333 resolved cases

Office Action

§101 §103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Status of Application This office action is in response to the most recent filings by applicants on 08/10/26. Claims 1, 3-8, 10-15 and 17-20 are amended Claims 2, 9 and 16 are cancelled No claims are added Claims 1, 3-8, 10-15, and 17-20 are pending Note: In the amended independent claims 1, 8 and 15, the claim limitations discussed are broad and the specification does not provide enough detailed support to show to one of ordinary skill in the art what certain terms in the claim limitations mean. For instance, in claim 1, regarding the claim limitation “receiving, via a user interface, a first constraint and a second constraint, the first constraint being a total budget for the identified plurality of geographic regions, the second constraint that one incentive value be determined for each geographic region of the identified plurality of geographic regions; determining, by the one or more servers, one incentive value for available delivery associates of the on-demand delivery platform for each geographic region of the identified plurality of geographic regions using an optimization module to generate incentive values for the plurality of geographic regions, wherein the determining of the one incentive value for each geographic region comprises:” In light of the specification, [0067]: In some implementations, the constraints are adjusted manually by a system administrator. For example, an administrator manually adjusts the overall budget through a user interface that is configured for maintaining constraints of an optimization module 424. In other implementations, the constraints are adjusted automatically by optimization module 424. For example, after optimization module 424 has been setting incentive values for a period of time, the optimization module can leverage a data set of historical budgets and how they corresponded to selected delivery quality values. With that information, optimization module 424 can use refine the overall budget based on the more accurate information. For example, if the budget was set for $1 million, but optimization module 424 infers that a budget of $1,010,005 would lead to A much higher overall delivery quality, then the overall budget could be adjusted to that $1,010,005 value and optimized accordingly. [0069]: In some implementations, multiple constraints might be used by the integer programming model to determine incentive values. For example, there may be a constraint for an overall budget and a constraint that there be one incentive per region. In another example, there might be constraints set on a per-region level, e.g., the West Berkeley neighborhood has a local budget of $1,000, and the Elmwood neighborhood has a local budget of $2,000. In addition, applicants have pointed to [0003]-[0004], [0017], [0064] in the most recently submitted remarks 02/23/26, pages 11-12. None of the cited paragraphs shows the above steps being performed automatically. In fact, even the paragraphs applicants have pointed to describe an administrator performing the above steps. [0064] Constraints of the integer programming model can be modified as necessary. For example, an administrator may change the overall budget value from $1 million to $1.25 million. This might be done because delivery associate performance for the on- demand delivery platform might be a higher priority and as such supplier quality would increase at the expense of a higher budget. Likewise, the overall budget can be decreased if saving money becomes an increased priority. In light of these notes, the amended claims, do not overcome previously presented rejections under 101. As is discussed below. This note is intended as a conversation starter to help applicants understand the examiner’s perspective. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1, 3-8, 10-15, and 17-20 is/are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., an abstract idea) without significantly more. Step One - First, pursuant to step 1 in the January 2019 Guidance on 84 Fed. Reg. 53, the claims 1, 3-7 is/are directed to a method which is a statutory category. Step One - First, pursuant to step 1 in the January 2019 Guidance on 84 Fed. Reg. 53, the claims 8, 10-14 is/are directed to a device/apparatus which is a statutory category. Step One - First, pursuant to step 1 in the January 2019 Guidance on 84 Fed. Reg. 53, the claims 15, 17-20 is/are directed to a computer program product which is a statutory category. Under the 2019 PEG, Step 2A under which a claim is not “directed to” a judicial exception unless the claim satisfies a two-prong inquiry. Further, particular groupings of abstract ideas are consistent with judicial precedent and are based on an extraction and synthesis of the key concepts identified by the courts as being abstract. With respect to the Step 2A, Prong One, the claims as drafted, and given their broadest reasonable interpretation, fall within the Abstract idea grouping of “certain methods of organizing human activity” (business relations; relationships or interactions between people). For instance, independent Claim 1 is directed to an abstract idea, as evidenced by claim limitations “identifying, a plurality of geographic regions serviced by an on-demand delivery platform, the plurality of geographic regions identified according to different levels of granularity based, at least in part, on both density of populations in the plurality of geographic regions and delivery capacity of the on-demand delivery platform across the plurality of geographic regions, wherein the identified plurality of geographic regions comprises one or more cities, one or more neighborhoods, and one or more subsections of a particular neighborhood; training, using historical demand for deliveries data stored, the historical demand for deliveries data representing completed deliveries for at least one time frame; automatically generating, a predicted demand for deliveries based on the historical demand for deliveries data, the predicted demand for deliveries representing customer demand for deliveries of the on-demand delivery platform for the plurality of geographic regions and for a period of time; automatically generating, a predicted supply of delivery associates using the trained machine learning algorithm based on historical supply of delivery associates data, the predicted supply of delivery associates of the on-demand delivery platform for the plurality of geographic regions and for a period of time; generating, a plurality of delivery quality values for each corresponding geographic region of the plurality of geographic regions and for the period of time of time, the plurality of delivery quality values determined based on the predicted demand for deliveries and the predicted supply of delivery associates, the plurality of delivery quality values corresponding to a plurality of incentive values; receiving, a first constraint and a second constraint, the first constraint being a total budget for the identified plurality of geographic regions, the second constraint that one incentive value be determined for each geographic region of the identified plurality of geographic regions; determining, one incentive value for available delivery associates of the on-demand delivery platform for each geographic region of the identified plurality of geographic regions using an optimization module to generate incentive values for the plurality of geographic regions, wherein the determining of the one incentive value for each geographic region comprises: identifying an objective function for maximizing delivery quality values; and selecting, one incentive value from the plurality of incentive values based at least in part on the first constraint, the second constraint, and the objective function such that a total cost of the incentive values generated for the plurality of geographic regions is less than the total budget, wherein the generated incentive values for the plurality of geographic regions maximize the delivery quality values; determining that a delivery associate of the available delivery associates of the on demand delivery platform has a history of delivery to a particular geographic region of the plurality of geographic regions; transmitting, a notification of a first one incentive value of the generated incentive values that corresponds to the particular geographic region of the delivery associate of the on-demand delivery platform, the first one of the generated incentive values being associated with a particular date for the particular geographic region.” These claim limitations belong to the grouping of “certain methods of organizing human activity” because the claims are related to balancing demand and supply predictions by determining incentives to better help meet demand needs. Managing the balancing demand and supply predictions by determining incentives to better help meet demand needs for one or more human entities involves organizing human activity based on the description of “certain methods of organizing human activity” provided by the courts. The court have used the phrase “Certain methods of organizing human activity” as —fundamental economic principles or practices (including hedging, insurance, mitigating risk); commercial or legal interactions (including agreements in the form of contracts; legal obligations; advertising, marketing or sales activities or behaviors; business relations); managing personal behavior or relationships or interactions between people (including social activities, teaching, and following rules or instructions). Independent Claims 8 and 15 is/are recite substantially similar limitations to independent claim 1 and is/are rejected under 2A for similar reasons to claim 1 above. With respect to the Step 2A, Prong Two - This judicial exception is not integrated into a practical application. In particular, the claim only recites “A method comprising: by the one or more servers, a machine learning algorithm, in a database, the machine learning algorithm being a decision-tree based algorithm, by the one or more servers, using the trained machine learning algorithm, by the one or more servers, of the optimization module, by the one or more servers, from a database, and using the optimization module, to a client device, A computer program product comprising one or more non-transitory computer readable media having instructions stored thereon for performing a method, the method comprising: An on-demand delivery platform including memory and a processor configured to cause:”, such that it amounts to no more than: adding the words “apply it” (or an equivalent) with the judicial exception, or mere instructions to implement an abstract idea on a computer, or merely uses a computer as a tool to perform an abstract idea, as discussed in MPEP 2106.05(f). Regarding the claim limitations above, the additional elements of a “machine learning model” or “training, by the one or more servers, a machine learning algorithm using historical demand data stored in a database, the machine learning algorithm being a decision-tree based algorithm”, this language merely requires execution of an algorithm that can be performed by a generic computer component and provides no detail regarding the operation of that algorithm. As such, the claim requirement amounts to mere instructions to implement the abstract idea on a computer, and, therefore, is not sufficient to make the claim patent eligible. See Alice, 573 U.S. at 226 (determining that the claim limitations “data processing system”, “communications controller,” and “data storage unit” were generic computer components that amounted to mere instructions to implement the abstract idea on a computer); October 2019 Guidance Update at 11–12 (recitation of generic computer limitations for implementing the abstract idea “would not be sufficient to demonstrate integration of a judicial exception into a practical application”). Such a generic recitation of a “machine learning model” is insufficient to show a practical application of the recited abstract idea. As demonstrated by use of language “machine learning model”, “training, by the one or more servers, a machine learning algorithm using historical demand data stored in a database, the machine learning algorithm being a decision-tree based algorithm”, “using an optimization module” and other similar limitations, without much technological details following the limitation are simply the preparation steps and subsequent use of machine to represent mere invocation of machinery per MPEP 2106.05(f)(2) possibly an example of a mathematical algorithm [here machine learning preparation] being applied on a general-purpose computer per MPEP 2106.05(f)(2)(i). Here, the claims are pre-processing data for use by the machine learning model to balancing demand and supply predictions by determining incentives to better help meet demand needs. The training step is math. To overcome the 101 the output of the model would have to be used in a meaningful way. Further, calculation steps, such as “determining a plurality of incentive values” also constitutes a mental process, such as an observation, evaluation, judgment, or opinion that can be performed in the human mind. The 2019 Guidance expressly recognizes such mental processes as constituting patent-ineligible abstract ideas. MPEP § 2106.04(a). Further still, “training a learning model” constitutes a mathematical concept, such as the concept of using known data to set and adjust coefficients and mathematical relationships of variables that represent some modeled characteristic or phenomenon. The 2019 Guidance expressly recognizes mathematical concepts including mathematical relationships as constituting an abstract idea. MPEP § 2106.04(a). As a result, claims 1, 8 and 15 do not provide any specifics regarding the integration into a practical application when recited in a claim with a judicial exception. Similarly, dependent claims 3-7, 10-14, and 17-20 are also directed to an abstract idea under 2A, first and second prong. In the present application, all of the dependent claims have been evaluated and it was found that they all inherit the deficiencies set forth with respect to the independent claims. For instance, dependent claims 4 recite “wherein the predicted demand for deliveries is categorized according to a geographical region of the plurality of geographic regions and the period of time”. Dependent claims 5 recite “wherein the one incentive value determined for each geographic region includes a first incentive value for a first geographic region of the plurality of geographic regions and a second incentive value determined for the first geographic region”. Dependent claims 6 recite “wherein generating the plurality of delivery quality values for each corresponding geographic region includes generating a first delivery quality value based on the first incentive value for the first geographical region and generating a second delivery quality value based on the second incentive value for the first geographical region”. Dependent claims 7 recite “wherein selecting one incentive value from the plurality of incentive values includes selecting the second incentive value as provided to the delivery associate”. Here, these claims offer further descriptive limitations of elements found in the independent claims which are similar to the abstract idea noted in the independent claim above. Dependent claims 3 recites “wherein automatically generating the predicted supply includes using the trained machine learning algorithm to determine a first amount of delivery associates in relation to a first incentive value and determine a second amount of delivery associates in relation to a second incentive value.” In this claim, “using a machine learning algorithm configured” is an additional element, but it is still being recited such that it amounts to no more than: adding the words “apply it” (or an equivalent) with the judicial exception, or mere instructions to implement an abstract idea on a computer, or merely uses a computer as a tool to perform an abstract idea, as discussed in MPEP 2106.05(f). As a result, Examiner asserts that dependent claims, such as dependent claims 3-7, 10-14, and 17-20 are also directed to the abstract idea identified above. With respect to Step 2B, the claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception. First, the invention lacks improvements to another technology or technical field [see Alice at 2351; 2019 IEG at 55], and lacks meaningful limitations beyond generally linking the use of an abstract idea to a particular technological environment [Alice at 2360, 2019 IEG at 55], and fails to effect a transformation or reduction of a particular article to a different state or thing [2019 IEG, 55]. For the reasons articulated above, the claims recite an abstract idea that is limited to a particular field of endeavor (MPEP § 2106.05(h)) and recites insignificant extra-solution activity (MPEP § 2106.05(g)). By the factors and rationale provided above with respect to these MPEP sections, the additional elements of the claims that fail to integrate the abstract idea into a practical application also fail to amount to “significantly more” than the abstract idea. As discussed above with respect to integration of the abstract idea into a practical application, the additional element(s) of “A method comprising: by the one or more servers, a machine learning algorithm, in a database, the machine learning algorithm being a decision-tree based algorithm, by the one or more servers, using the trained machine learning algorithm, by the one or more servers, of the optimization module, by the one or more servers, from a database, and using the optimization module, to a client device, A computer program product comprising one or more non-transitory computer readable media having instructions stored thereon for performing a method, the method comprising: An on-demand delivery platform including memory and a processor configured to cause:” are insufficient to amount to significantly more. Applicants originally submitted specification describes the computer components above at least in page/ paragraph 16, 24, 74, 76-77. In light of the specification, it should be noted that the components discussed above did not meaningfully limit the abstract idea because they merely linked the use of the abstract idea to a particular technological environment (i.e., "implementation via computers"). In light of the specification, it should be noted that the claim limitations discussed above are merely instructions to implement the abstract idea on a computer. See MPEP 2106.05(f). (See MPEP 2106.05(f) - Mere Instructions to Apply an Exception - “Thus, for example, claims that amount to nothing more than an instruction to apply the abstract idea using a generic computer do not render an abstract idea eligible.” Alice Corp., 134 S. Ct. at 235). Mere instructions to apply an exception using computer component cannot provide an inventive concept.). The claim fails to recite any improvements to another technology or technical field, improvements to the functioning of the computer itself, use of a particular machine, effecting a transformation or reduction of a particular article to a different state or thing, adding unconventional steps that confine the claim to a particular useful application, and/or meaningful limitations beyond generally linking the use of an abstract idea to a particular environment. See 84 Fed. Reg. 55. Viewed individually or as a whole, these additional claim element(s) do not provide meaningful limitation(s) to transform the abstract idea into a patent eligible application of the abstract idea such that the claim(s) amounts to significantly more than the abstract idea itself. Independent Claims 8 and 15 is/are recite substantially similar limitations to independent claim 1 and is/are rejected under 2B for similar reasons to claim 1 above. Further, it should be noted that additional elements of the claimed invention such as claim limitations when considered individually or as an ordered combination along with the other limitations discussed above in method claim 1 also do not meaningfully limit the abstract idea because they merely linked the use of the abstract idea to a particular technological environment (i.e., "implementation via computers"). In light of the specification, it should be noted that the claim limitations discussed above are merely instructions to implement the abstract idea on a computer. See MPEP 2106. Similarly, dependent claims 3-7, 10-14, and 17-20 also do not include limitations amounting to significantly more than the abstract idea under the second prong or 2B of the Alice framework. In the present application, all of the dependent claims have been evaluated and it was found that they all inherit the deficiencies set forth with respect to the independent claims. Further, it should be noted that the dependent claims do not include limitations that overcome the stated assertions. Here, the dependent claims recite features/limitations that include computer components identified above in part 2B of analysis of independent claims 1, 8 and 15. As a result, Examiner asserts that dependent claims, such as dependent claims 3-7, 10-14, and 17-20 are also directed to the abstract idea identified above. For more information on 101 rejections, see MPEP 2106, January 2019 Guidance at https://www.govinfo.gov/content/pkg/FR-2019-01 -07/pdf/2018-28282.pdf Claim Rejections - 35 USC § 103 - withdrawn In the most recent filings, applicants have amended independent claims 1, 8 and 15. Please see the Remarks dated 08/10/26, especially on pages 17-21 from applicants why the 103 rejection is overcome are persuasive. In light of applicants’ arguments and the amendments filed by applicants to previously presented claims in light of the originally filed disclosure the previously made rejection under 35 U.S.C. 103 has been withdrawn for following reasons: Independent claim 1, recites: “A method comprising: identifying, by one or more servers, a plurality of geographic regions serviced by an on-demand delivery platform, the plurality of geographic regions identified according to different levels of granularity based, at least in part, on both density of populations in the plurality of geographic regions and delivery capacity of the on-demand delivery platform across the plurality of geographic regions, wherein the identified the plurality of geographic regions comprises one or more cities, one or more neighborhoods, and one or more subsections of a particular neighborhood; training, by the one or more servers, a machine learning algorithm using historical demand for deliveries data stored in a database, the historical demand for deliveries data representing completed deliveries for at least one time frame, the machine learning algorithm being a decision-tree based algorithm; automatically generating, by the one or more servers, a predicted demand for deliveries using the trained machine learning algorithm based on the historical demand for deliveries data, the predicted demand for deliveries representing customer demand for deliveries of the on-demand delivery platform for the plurality of geographic regions and for a period of time; automatically generating, by the one or more servers, a predicted supply of delivery associates using the trained machine learning algorithm based on historical supply of delivery associates data, the predicted supply of delivery associates of the on-demand delivery platform for the plurality of geographic regions and for a period of time; generating, by the one or more servers, a plurality of delivery quality values for each corresponding geographic region of the plurality of geographic regions and for the period of time of time, the plurality of delivery quality values determined based on the predicted demand for deliveries and the predicted supply of delivery associates, the plurality of delivery quality values corresponding to a plurality of incentive values; receiving, via a user interface, a first constraint and a second constraint, the first constraint being a total budget for the identified plurality of geographic regions, the second constraint that one incentive value be determined for each geographic region of the identified plurality of geographic regions; determining, by the one or more servers, one incentive value for available delivery associates of the on-demand delivery platform for each geographic region of the identified plurality of geographic regions using an optimization module to generate incentive values for the plurality of geographic regions, wherein the determining of the one incentive value for each geographic region comprises: identifying an objective function of the optimization module for maximizing delivery quality values; and selecting, using the optimization module, one incentive value from the plurality of incentive values based at least in part on the first constraint, the second constraint, and the objective function such that a total cost of the incentive values generated for the plurality of geographic regions is less than the total budget, wherein the generated incentive values for the plurality of geographic regions maximize the delivery quality values; determining by the one or more servers, from a database, that a delivery associate of the available delivery associates of the on demand delivery platform has a history of delivery to a particular geographic region of the plurality of geographic regions; and transmitting, by the one or more servers, a notification of a first one incentive value of the generated incentive values that corresponds to the particular geographic region to a client device of the delivery associate of the on-demand delivery platform, the first one of the generated incentive values being associated with a particular date for the particular geographic region.” The amended claims recite limitations underline above, that none of the references cited - (US 2019/0266557) Berk; Jonathan et al., further in view of (US 2006/0136237) Spiegel; Joel R. et al. and Zhou et. al (2017/0221086) show the claim limitations discussed above in light of the specification. Even though, Reference (US 2019/0266557) Berk; Jonathan et al. shows in Berk: [0064]: method, Berk: [0033]-[0034]: delivery platform, [0034] taking into consideration the challenges with delivery for carriers or service providers and creating incentives to help more carriers want to deliver in certain areas. This reads on the limitation above, since the granularity of the location of delivery and the difficulty of the delivery both address most of the limitation above. Similarly, in [0039] In some embodiments, the delivery routing system tracks the courier acceptance rate of the system for a given location and time. Various metrics may be used to determine the courier acceptance rate. For example, the courier acceptance rate may correspond to the average number of delivery opportunities that are declined for a given location and time. In other embodiments, the courier acceptance rate may correspond to the average amount of time between the creation of an order and acceptance of the delivery opportunity for such order. In yet other embodiments, the courier acceptance rate may correspond to the average amount of time between the transmittal of the delivery opportunity to the courier device and the acceptance of the delivery opportunity for such order. (Abstract): described are systems and processes for generating dynamic effort-based delivery value predictions for real-time delivery of perishable goods. In one aspect, a system is configured for generating dynamic delivery value predictions for delivery opportunities provided to couriers. For each order, delivery events and corresponding timestamps are received from devices operated by customers, restaurants, and couriers. Based on the timestamps, the system generates a predicted delivery duration with trained predictive models that use weighted factors such as order data and historical restaurant data. A service value for the delivery of the order is determined based the predicted delivery duration and a predetermined active time value. The service value is then transmitted along with the corresponding delivery opportunity to a user device of a courier. The determined service values may be adjusted based on courier acceptance rates of delivery opportunities and other factors such as customer experience. [0001] The present disclosure relates to a system for facilitating a real-time, on-demand delivery platform for perishable goods. In one example, the present disclosure relates to mechanisms and processes for dynamic valuations of deliveries. [0011] Other implementations of this disclosure include corresponding devices, systems, and computer programs, as well as and associated methods for dynamically predicting delivery service values. These other implementations may each optionally include one or more of the following features. For instance, provided is a programmable device configured for generating dynamic delivery value predictions for real-time delivery of perishable goods using a predictive machine learning model. The programmable device is configured to operate in a training mode and an inference mode. Berk: [0092]: delivery parameters may include time, date, traffic, weather, historical courier performance, and size of markets, [0140]: dates may fall on holidays that are historically known to be busy days. Further, Berk shows [0036]: a delivery tracking system generates ETA predictions using a predictive event model that implements machine learning to evaluate weighted factors. In some embodiments, the predictive event model may implement a neural network. In other embodiments, the predictive event model may be a gradient boosted machine or gradient boosted decision tree. [0037]: the predictive event model may iteratively update various decision trees and corresponding error measurements. [0088]: a gradient boosted machine implemented in various example embodiments may comprise a plurality of iteratively trained chained decision trees. A single decision tree may be trained at a time with each subsequent decision tree trained based on the measured error from the previously trained decision tree. [0158]: the service valuation model may be a gradient boosted machine based off of iteratively trained decisions trees. Berk shows [0099] In some embodiments, the item types in an order may be input as parameters. For example, certain dishes may be correlated with particular preparation times. In some embodiments, the size of an order may be input as predictive parameters. In some embodiments, more items within an order may correlate to longer preparation times. In some embodiments, the sub-total price of an order may also correspond to order size or order preparation time. For example, a larger sub-total may correlate to a larger amount of items within the order. Additionally, more expensive items may take longer to make, due to more ingredients, more difficulty, or more specialization in preparation. [0147] As another example, increased delivery distances may require additional effort by the courier or fuel expense. Therefore, an additional supplemental value may be added based on additional travel distance above a predetermined threshold distance, such as $0.75 per additional mile beyond 5 miles. Berk: [0034]: Current systems for determining delivery values do not sufficiently align incentives of the couriers with those of the merchants and customers, as well as those of the delivery platform. For example, many delivery opportunities may be declined by a courier where the base pay for a delivery is the same for all deliveries in a given market location causing compensation for more difficult deliveries to be undervalued. In some cases, couriers would selectively choose to accept only delivery opportunities with larger orders due to a higher likelihood of substantial gratuity. This also caused many smaller order delivery opportunities to be declined. This may also result in high volatility and inconsistency in courier compensation. Existing systems are also inflexible and may not provide a structure which allows testing to optimize delivery valuation around a supply and demand equilibrium, or implementation of adjustments to the model. [0041] This approach more closely links the delivery value with the effort required to complete the delivery and results in compensation that is more aligned with the work associated with each delivery. Linking delivery value with effort results in one or more improvements over existing systems and mechanisms. First, the incentives of the couriers are more aligned with those of the merchants and customers by preventing couriers from selectively choosing larger orders over smaller orders, which would reduce volatility in compensation for deliveries across all couriers. Also see, [0079]. Berk shows [0099] In some embodiments, the item types in an order may be input as parameters. For example, certain dishes may be correlated with particular preparation times. In some embodiments, the size of an order may be input as predictive parameters. In some embodiments, more items within an order may correlate to longer preparation times. In some embodiments, the sub-total price of an order may also correspond to order size or order preparation time. For example, a larger sub-total may correlate to a larger amount of items within the order. Additionally, more expensive items may take longer to make, due to more ingredients, more difficulty, or more specialization in preparation. [0147] As another example, increased delivery distances may require additional effort by the courier or fuel expense. Therefore, an additional supplemental value may be added based on additional travel distance above a predetermined threshold distance, such as $0.75 per additional mile beyond 5 miles. Berk shows “the second constraint being a quantity of incentive values per geographic region”: [0033]: couriers are incentivized to maximize compensation for a delivery for the least amount of time or effort involved. [0041]: the incentives of the couriers are more aligned with those of the merchants and customers by preventing couriers from selectively choosing larger orders over smaller orders, which would reduce volatility in compensation for deliveries across all couriers. [0152] This aligns the incentives of the couriers with the merchants and customers by preventing couriers from selectively choosing large orders over smaller orders. Thus, smaller orders and orders with inaccessible merchant locations will experience improved service quality. Berk: [0033]: couriers are incentivized to maximize compensation for a delivery for the least amount of time or effort involved. [0041]: the incentives of the couriers are more aligned with those of the merchants and customers by preventing couriers from selectively choosing larger orders over smaller orders, which would reduce volatility in compensation for deliveries across all couriers. [0152] This aligns the incentives of the couriers with the merchants and customers by preventing couriers from selectively choosing large orders over smaller orders. Thus, smaller orders and orders with inaccessible merchant locations will experience improved service quality. [0153] This approach would also increase courier acceptance rates, which results in improved overall efficiency, and less down time between orders. It also provides a dynamic means of adjusting courier acceptance rates by automatically determining an improved active time value. Increasing courier acceptance rates, or the likelihood of courier acceptance, of first-time delivery opportunities also ensures that more deliveries completed by more optimally available couriers. Berk: [0034], [0041]. [0091]: a predictive event model implementing a neural network may comprise a plurality of subnetworks, each of which function as a predictive event model to generate an estimated length of time for a particular interval of time between subsequent delivery events. Berk: [0033]: couriers are incentivized to maximize compensation for a delivery for the least amount of time or effort involved. [0041]: the incentives of the couriers are more aligned with those of the merchants and customers by preventing couriers from selectively choosing larger orders over smaller orders, which would reduce volatility in compensation for deliveries across all couriers. [0152] This aligns the incentives of the couriers with the merchants and customers by preventing couriers from selectively choosing large orders over smaller orders. Thus, smaller orders and orders with inaccessible merchant locations will experience improved service quality. [0153] This approach would also increase courier acceptance rates, which results in improved overall efficiency, and less down time between orders. It also provides a dynamic means of adjusting courier acceptance rates by automatically determining an improved active time value. Increasing courier acceptance rates, or the likelihood of courier acceptance, of first-time delivery opportunities also ensures that more deliveries completed by more optimally available couriers. However, Berk does not show “density of population” consideration. Reference Berk does not show “predicted demand”. Berk does not show “predicted supply” in the claim above. Berk does not explicitly show a budget and as such does not show: “a first constraint and a second constraint, the first constraint being a total budget for the plurality of geographic regions”. As such, the reference does not show the above claim limitations. Reference Spiegel shows “density of population” consideration collecting and analyzing customer demographic information in [0069], [0071]-[0074] and order volume in [0075]-[0081], [0091]. This reads on “density of population” in the claim. Spiegel also in shows [0058]-[0059]: A destination may be a completely specified delivery address, but in some embodiments a predictive shipping model may support latency predictions for multiple degrees of granularity of destinations (e.g., broad geographical regions, specific geographical areas, delivery zones/routes within geographical areas, street addresses, etc.). Additionally, in some embodiments a predictive shipping model may predict shipping outcomes in addition to or other than latency. For example, a shipping model may be configured to predict a route (such as a sequence of hubs 120) that will be traversed by a given package 260. [0059]: For example, latencies for shipping from a particular geographical area may vary depending on the point within the region a package 260 is tendered (e.g., at a hub 120, from a fulfillment center 110, or from another location). [0027] FIGS. 9A-9C illustrate an example method for generating dynamic delivery value predictive updates using a predictive machine learning model, in accordance with one or more embodiments. [0036] Accordingly, the present disclosure describes various examples of delivery tracking and pairing systems and processes that provide ways of more accurately determining the value of a delivery by associating the value with delivery effort. In some examples, a delivery tracking system generates ETA predictions using a predictive event model that implements machine learning to evaluate weighted factors. In some embodiments, the predictive event model may implement a neural network. In other embodiments, the predictive event model may be a gradient boosted machine or gradient boosted decision tree. [0160] With reference to FIGS. 9A-9C, shown an example method 900 for generating dynamic delivery value predictive updates using a predictive machine learning model, in accordance with one or more embodiments. In certain embodiments, the predictive machine learning model may be a predictive event model and/or a service valuation model, and comprise one or more computational layers or chained decision trees. FIG. 9B illustrates an example of operations of the predictive model in the training mode 910 and inference mode 960, in accordance with one or more embodiments. Spiegel shows at least in [0077]: speculative shipment decision analysis by forecasting model 420… Similarly, risk tolerance for speculative shipment of packages 260 including various items may vary dependent upon volume and availability of those items. For example, forecasting model 420 may generally indicate against speculative shipment of low-volume items or items for which availability from suppliers is scarce. [0094]: inventory data supply chain data relevant to managing items in transit between supplier(s) 1020 and fulfillment center(s) 110. Spiegel shows “predicted supply” at least in [0077]: speculative shipment decision analysis by forecasting model 420… Similarly, risk tolerance for speculative shipment of packages 260 including various items may vary dependent upon volume and availability of those items. For example, forecasting model 420 may generally indicate against speculative shipment of low-volume items or items for which availability from suppliers is scarce. [0094]: inventory data supply chain data relevant to managing items in transit between supplier(s) 1020 and fulfillment center(s) 110. However, the reference does not show the above claim limitations. Reference Zhou shows “predicted demand” at least in Fig. 3 and Fig. 4 as well as [0028]-[0034]: FIG. 3 shows an exemplary graph 300 that summarizes historical sales orders associated with a customer. More particularly, the graph 300 depicts the original price 302 and coupon discount 304 redeemed by the customer at different time stamps. The time interval #304 in Fig. 3 and #404 – 406 in Fig. 4 read on the claim limitations above). Zhou shows the above limitation at least in [0018]: the present framework may automatically optimize various coupon parameters (e.g., redemption value, distribution date, expiration date, target customer type) so as to maximize return-on-investment while observing certain constraints (e.g., budget, time). [0024]: Coupon distribution optimizer 125 may include, for example, a return-on-investment (ROI) ratio calculator, a customer selector and a budget updater. [0030]: Each marketing campaign data record may be represented by a database table (or other data structure) that stores, for example, campaign identifier, campaign name, campaign budget, start and end timestamps of the campaign, [0031]: The user interface screen 500 may display various user-editable fields 502-510 for customizing campaign property values. The fields may include, but are not limited to, campaign name 502, campaign budget 504, target customer type 506 (e.g., new user, very important person, all, etc.), start date (or timestamp) 508 and end date (or timestamp) 510 of the marketing campaign. The budget 504 is the estimated expenditure intended for marketing purposes (e.g., coupon redemption values). The total redemption value of distributed coupons should not exceed the budget 504. [0034] Based on the historical data of sales orders and coupon distribution, the framework may seek to optimize parameters (e.g., value, distribution date, expiration date) of time-sensitive electronic coupons to offer to various customers in order to maximize the return-on-investment, given the budget constraint B and the time period constraint with start time S and end time E of the marketing campaign. [0035] Suppose there are H customized time-sensitive coupons Cn.sub.h, h=1, 2, . . . , H to be offered while maximizing the return-on-investment within the budget constraint B and the time period constraint. The objective function may then be expressed as follows: [0037], [0039]: At 208, coupon distribution optimizer 125 updates the remaining budget Br for the marketing campaign. The budget may be updated by subtracting the redemption values of distributed coupons from the currently available budget Br. However, the reference does not show the above claim limitations. *Additionally, the prior art made of record and not relied upon is considered pertinent to applicant's disclosure; however, the reference does not show the above claim limitations: NPL Reference: Reference Kaiser, Tom. Experts predict huge growth for on-demand delivery services. Food on demand: The intersection of Food, Technology, & Mobility. https://foodondemandnews.com/10312016/experts-predict-huge-growth-for-on-demand-delivery-services/ Holger Luedorf, senior vice president of business development at Postmates, predicts substantial growth ahead for the industry, especially in retail- and convenience-oriented deliveries. Since joining the company in mid-2014, he’s seen the company grow from fewer than 10,000 deliveries a month to approximately 1.5 million deliveries by late 2016. However, the reference does not show the claim limitations above. Foreign Reference: Reference (KR 102041971 B1) OH YOUNG. The reference discloses cloud delivery service system comprises: a smart delivery management system ordering delivery by issuing a label to be attached to a logistics box, constituting routing setting modeling of the least expense delivery path for delivery, calculating and providing a delivery path and costs using the constituted routing setting modeling of the least expense delivery path, and calculating costs generated by the delivery; a shipper company terminal receiving the issued label in remote from the smart delivery management system and scanning a label of a logistics box corresponding to an order history for delivery to connect the order history with the logistics box; and a delivery company terminal registering a main driving path in the smart delivery management system and receiving the calculated information of the delivery path and costs. However, the reference does not show the claim limitations above. None of the prior art of record, taken individually or in combination, teach, interalia, the claimed invention as detailed in independent claims 1, 8 and 15, wherein the novelty of the claimed invention is in the combination of limitations and not in any single limitation. Response to Arguments Applicants’ arguments are moot in view of the new grounds of rejection necessitated by the amendments made to previously presented claims. Applicant’s Argument #1 Applicants argue on page(s) 11-17 of applicants remarks that the amended claims overcome previously presented rejection under 35 U.S.C. 101 (see applicants remarks for more details). Response to Argument #1 Applicants' arguments have been fully considered; however, the examiner respectfully disagrees. Please see the 101 rejection above and also the Note above. The claims are directed to balancing demand and supply predictions by determining incentives to better help meet demand needs and merely use a computer to improve the performance of that determination—not the performance of a computer. (See MPEP 2106.05(a)(II)(i); A commonplace business method or mathematical algorithm being applied on a general-purpose computer, Versata Dev. Group, Inc. v. SAP Am., Inc., 793 F.3d 1306, 1334, 115 USPQ2d 1681, 1701 (Fed. Cir. 2015)).  MPEP 2106.05f - Similarly, "claiming the improved speed or efficiency inherent with applying the abstract idea on a computer" does not integrate a judicial exception into a practical application or provide an inventive concept. Intellectual Ventures I LLC v. Capital One Bank (USA), 792 F.3d 1363 MPEP 2106.05(f) iii. A process for monitoring audit log data that is executed on a general-purpose computer where the increased speed in the process comes solely from the capabilities of the general-purpose computer, FairWarning IP, LLC v. Iatric Sys., 839 F.3d 1089, 1095, 120 USPQ2d 1293, 1296 (Fed. Cir. 2016); As discussed above in step 2A prong 2 the additional elements are recited without much technological details following the limitation are simply the preparation steps and subsequent use of machine to represent mere invocation of machinery per MPEP 2106.05(f)(2) possibly an example of a mathematical algorithm [here machine learning preparation] being applied on a general-purpose computer per MPEP 2106.05(f)(2)(i). Here, the claims are pre-processing data for use by the machine learning model to balancing demand and supply predictions by determining incentives to better help meet demand needs. The training step is math. To overcome the 101 the output of the model would have to be used in a meaningful way. Further, determining steps also constitute a mental process, such as an observation, evaluation, judgment, or opinion that can be performed in the human mind. The 2019 Guidance expressly recognizes such mental processes as constituting patent-ineligible abstract ideas. MPEP § 2106.04(a). Further still, training a learning model constitutes a mathematical concept, such as the concept of using known data to set and adjust coefficients and mathematical relationships of variables that represent some modeled characteristic or phenomenon. The 2019 Guidance expressly recognizes mathematical concepts including mathematical relationships as constituting an abstract idea. MPEP § 2106.04(a). Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. NPL Reference: Kaiser, Tom. Experts predict huge growth for on-demand delivery services. Food on demand: The intersection of Food, Technology, & Mobility. https://foodondemandnews.com/10312016/experts-predict-huge-growth-for-on-demand-delivery-services/ Holger Luedorf, senior vice president of business development at Postmates, predicts substantial growth ahead for the industry, especially in retail- and convenience-oriented deliveries. Since joining the company in mid-2014, he’s seen the company grow from fewer than 10,000 deliveries a month to approximately 1.5 million deliveries by late 2016. Foreign Reference: (KR 102041971 B1) OH YOUNG. The reference discloses cloud delivery service system comprises: a smart delivery management system ordering delivery by issuing a label to be attached to a logistics box, constituting routing setting modeling of the least expense delivery path for delivery, calculating and providing a delivery path and costs using the constituted routing setting modeling of the least expense delivery path, and calculating costs generated by the delivery; a shipper company terminal receiving the issued label in remote from the smart delivery management system and scanning a label of a logistics box corresponding to an order history for delivery to connect the order history with the logistics box; and a delivery company terminal registering a main driving path in the smart delivery management system and receiving the calculated information of the delivery path and costs. Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to NANCY PRASAD whose telephone number is (571)270-3265. The examiner can normally be reached M-F: 8:00 AM - 4:30 PM EST. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Patricia Munson can be reached on (571)270-5396. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /N.N.P/Examiner, Art Unit 3624 /HAMZEH OBAID/Primary Examiner, Art Unit 3624
Read full office action

Prosecution Timeline

Show 39 earlier events
Feb 18, 2026
Examiner Interview Summary
Feb 23, 2026
Request for Continued Examination
Mar 10, 2026
Response after Non-Final Action
Apr 09, 2026
Non-Final Rejection mailed — §101, §103
Jul 30, 2026
Applicant Interview (Telephonic)
Jul 30, 2026
Examiner Interview Summary
Aug 10, 2026
Response Filed
Oct 27, 2026
Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12664501
NON-INTRUSIVE TECHNIQUES FOR DISCOVERING AND USING ORGANIZATIONAL RELATIONSHIPS
3y 9m to grant Granted Jun 23, 2026
Patent 12555114
FRAUD DETECTION USING MULTI-TASK LEARNING AND/OR DEEP LEARNING
5y 7m to grant Granted Feb 17, 2026
Patent 12493891
SIGHT INFORMATION COLLECTION IN HEAD WORN COMPUTING
4y 0m to grant Granted Dec 09, 2025
Patent 12045838
SYSTEM AND METHOD OF IDENTIFICATION AND AUTHENTICATION FOR TRACING AGRICULTURAL ASSETS, IDENTIFICATION ELEMENT FOR SECURE IDENTIFICATION OF AGRICULTURAL ASSETS AND CORRESPONDING COMPUTER PROGRAMS
4y 1m to grant Granted Jul 23, 2024
Patent 12039570
USER-CUSTOMIZABLE, USER-PERSONALIZABLE AND USER COMPENSABLE KEYBOARD PROVIDING SYSTEM AND METHOD
3y 6m to grant Granted Jul 16, 2024
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

11-12
Expected OA Rounds
21%
Grant Probability
40%
With Interview (+18.9%)
5y 3m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 333 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month