IP Library Granted Patent US 12,737,721
Granted Patent B2
US 12,737,721 · App. 18/567,153 · Granted Sep 15, 2026

Server and method for managing orders

Inventors: Sai-Ming Li (Issaquah, WA); Brandon O'Brien (Snohomish, UA)
Assignee: GRABTAXI HOLDINGS PTE. LTD.
G06Q10/087
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,737,721
App. No.
18/567,153
Granted
Sep 15, 2026
Kind
B2
Abstract

A system configured for managing orders is disclosed. The system may include one or more processor(s) which may determine a plurality of merchants selling a product within a predetermined area; determine an original price of the product sold by each merchant of the plurality of determine a discount that each merchant of the plurality of merchants is willing to offer on the product; determine a minimum selling price of the product based on the original price and the discount from each merchant of the plurality of merchants; rank the plurality of merchants based on the minimum selling price of each merchant and determine top N merchants out of the plurality of merchants, wherein when a user puts in an order for the product, the system allocates the order to a highest rank merchant out of the top N merchants.

Claims (39)

1 . A system configured for managing orders, the system comprising: one or more processor(s); and

a memory having instructions stored therein, the instructions, when executed by the one or more processor(s), cause the one or more processor(s) to:

determine, via a server, a plurality of merchants selling a product within a predetermined area;

determine, via the server, an original price of the product sold by each merchant of the plurality of merchants;

determine, via the server, a discount that each merchant of the plurality of merchants is willing to offer on the product;

determine, via a pricing engine, a minimum selling price of the product based on the original price and the discount from each merchant of the plurality of merchants; and

rank, via a ranking engine, the plurality of merchants based on the minimum selling price of each merchant and a dynamic merchant quality score determined from historical fulfillment rate, delivery time performance, and customer feedback, and determine top N merchants out of the plurality of merchants;

wherein when a user puts in an order for the product, the system automatically allocates, via an order assignment engine, the order to a highest rank merchant out of the top N merchants.

2 . The system of claim 1 , wherein the user is unaware of which merchant the one or more processor allocates the order to until the user receives the product.

3 . The system of claim 1 , wherein the one or more processor is configured to:

determine an order price for the product based a maximum selling price out of the minimum selling price of each merchant in the top N merchants.

4 . The system of claim 3 , wherein the user is notified of the order price of the product at the time of placing the order.

5 . The system of claim 1 , wherein the one or more processor is configured to:

allocate the order to a second highest rank merchant out of the top N merchants if the highest rank merchant rejects the order.

6 . The system of claim 1 , wherein the one or more processor is configured to:

receive information from each merchant out of the plurality of merchants every M period;

redetermine a new top N merchants based on the information from each merchant.

7 . The system of claim 6 , wherein the information comprises at least one of: current merchant demand, and current availability of product.

8 . The system of claim 1 , wherein the user is located in the predetermined area.

9 . A method for managing orders, the method comprising:

using one or more processor(s) to:

determine, via a server, a plurality of merchants selling a product within a predetermined area;

determine, via the server, an original price of the product sold by each merchant of the plurality of merchants;

determine, via the server, a discount that each merchant of the plurality of merchants is willing to offer on the product;

determine, via a pricing engine, a minimum selling price of the product based on the original price and the discount from each merchant of the plurality of merchants; and

rank, via a ranking engine, the plurality of merchants based on the minimum selling price of each merchant and a dynamic merchant quality score determined from historical fulfillment rate, delivery time performance, and customer feedback, and determine top N merchants out of the plurality of merchants;

wherein when a user puts in an order for the product, the system automatically allocates, via an order assignment engine, the order to a highest rank merchant out of the top N merchants.

10 . The method of claim 9 , wherein the user is unaware of which merchant the one or more processor allocates the order to until the user receives the product.

11 . The method of claim 9 , the method comprising using the one or more processor to:

determine an order price for the product based a maximum selling price out of the minimum selling price of each merchant in the top N merchants.

12 . The method of claim 11 , wherein the user is notified of the order price of the product at the time of placing the order.

13 . The method of claim 9 , the method comprising using the one or more processor to:

allocate the order to a second highest rank merchant out of the top N merchants if the highest rank merchant rejects the order.

14 . The method of claim 9 , the method comprising using the one or more processor to:

receive information from each merchant out of the plurality of merchants every M period;

redetermine a new top N merchants based on the information from each merchant.

15 . The method of claim 14 , wherein the information comprises at least one of: current merchant demand, and current availability of product.

16 . The method of claim 9 , wherein the user is located in the predetermined area.

17 . A non-transitory computer-readable medium storing computer executable code comprising instructions for managing orders according to claim 1 .

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2023
From: LI, SAI-MING; O'BRIEN, BRANDON
To: GRAB TECHNOLOGY LLC
Reel/Frame 065765/0363 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2023
From: GRAB TECHNOLOGY LLC
To: GRABTAXI HOLDINGS PTE. LTD.
Reel/Frame 065765/0486 →
Priority Claims (1)
SG 10202107189Y · Jun 30, 2021 · national
Continuity (1)
Related Publication 20240265343A1 · Aug 8, 2024
References Cited (22)
US 8594617B2 · Papakostas · 2013 [cited by examiner]
US 10592925B2 · Dennett · 2020 [cited by examiner]
US 10909486B1 · Tsou · 2021 [cited by examiner]
US 11611995B2 · Li · 2023 [cited by examiner]
US 11941089B2 · Baldwin · 2024 [cited by examiner]
US 20020107747A1 · Gerogianni · 2002 [cited by examiner]
US 20070150387A1 · Seubert · 2007 [cited by examiner]
US 20070239560A1 · McGuire · 2007 [cited by examiner]
US 20110258029A1 · Lutnick · 2011 [cited by examiner]
US 20140101001A1 · Brown · 2014 [cited by examiner]
US 20140281918A1 · Wei · 2014 [cited by examiner]
US 20170069017A1 · Friedman · 2017 [cited by examiner]
US 20170287038A1 · Krasadakis · 2017 [cited by examiner]
US 20180240167A1 · Kumar · 2018 [cited by examiner]
US 20180330314A1 · Pareek · 2018 [cited by examiner]
US 20190019124A1 · Shariff · 2019 [cited by examiner]
US 20220222731A1 · Kumar · 2022 [cited by examiner]
CA 2760901C · 2021 [cited by examiner]
CN 109064242A · 2018 [cited by applicant]
CN 111523922A · 2020 [cited by applicant]
CN 115222197A · 2022 [cited by examiner]
International Search Report and Written Opinion dated Jan. 13, 2023 which was issued in connection with PCT/SG2022/050441. [cited by applicant]