US 11,941,548 B2
System and method for matching patrons, servers, and restaurants within the food service industry
Nagib Georges Mimassi, Palo Alto, CA (US)
Assigned to ROCKSPOON, INC., San Jose, CA (US)
Filed by RockSpoon, Inc., San Jose, CA (US)
Filed on Jan. 8, 2022, as Appl. No. 17/571,459.
Application 17/571,459 is a continuation of application No. 16/950,068, filed on Nov. 17, 2020, granted, now 11,222,297.
Application 16/950,068 is a continuation of application No. 17/097,443, filed on Nov. 13, 2020, granted, now 11,257,105.
Application 17/097,443 is a continuation in part of application No. 17/091,925, filed on Nov. 6, 2020, granted, now 11,334,866.
Application 17/091,925 is a continuation in part of application No. 17/005,038, filed on Aug. 27, 2020, granted, now 11,232,426.
Application 17/005,038 is a continuation in part of application No. 16/796,342, filed on Feb. 20, 2020, granted, now 10,803,442, issued on Oct. 13, 2020.
Claims priority of provisional application 63/073,814, filed on Sep. 2, 2020.
Claims priority of provisional application 63/070,895, filed on Aug. 27, 2020.
Claims priority of provisional application 62/964,413, filed on Jan. 22, 2020.
Claims priority of provisional application 62/938,817, filed on Nov. 21, 2019.
Prior Publication US 2022/0122020 A1, Apr. 21, 2022
Int. Cl. G06Q 10/02 (2012.01); G06F 16/9035 (2019.01); G06F 18/23 (2023.01); G06N 20/00 (2019.01); G06Q 10/0639 (2023.01); G06Q 50/12 (2012.01)
CPC G06Q 10/02 (2013.01) [G06F 16/9035 (2019.01); G06F 18/23 (2023.01); G06N 20/00 (2019.01); G06Q 10/06393 (2013.01); G06Q 10/06395 (2013.01); G06Q 10/06398 (2013.01); G06Q 50/12 (2013.01)] 12 Claims
OG exemplary drawing
 
1. A system for matching patrons and servers at restaurants, comprising:
a computing device comprising a memory, a processor, and a data storage device;
a database residing in the data storage device, the database comprising profiles of patrons and servers and information about external factors;
a profile mapping and recommendation engine comprising a plurality of programming instructions stored in the memory, and operating on the processor, wherein the plurality of programming instructions, when operating on the processor, cause the computing device to:
retrieve a patron's profile from the database;
retrieve the server profiles from the database;
retrieve a plurality of external factors from the database;
map the patron's profile, the server profiles, and the plurality of external factors in a computational graph and use graph analysis algorithms to identify a plurality of servers who are most connected with the patron in the computational graph, wherein patrons are mapped to servers according to the following process:
patrons are initially mapped to servers according to a first clustering algorithm in which a first variance measures discrepancies between the patrons and servers by probability distribution and a second variance measures discrepancies between the patrons and servers by overall stationary distribution; and
for patrons matching two or more servers in the first clustering algorithm, those patrons are then mapped to servers according to a second clustering algorithm in which a shortest path between each patron and each server in the computational graph is calculated; and
match the patron to one of the servers in the plurality of servers based on the mapping and on the plurality of external factors.