IP Library › Granted Patent US 12,488,368
Granted Patent B2
US 12,488,368 · App. 18/582,839 · Granted Dec 2, 2025

Systems and methods for intelligent promotion design with promotion scoring

Inventor: Michael Montero (Palo Alto, CA)
Assignee: Maplebear Inc.
G06Q30/0244G06Q30/0201G06Q30/0239G06Q30/0271G06N20/00
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,488,368
App. No.
18/582,839
Granted
Dec 2, 2025
Kind
B2
Abstract

Systems and methods for scoring promotions are provided. A set of training offers are received, which include combinations of variable values. These combinations of variable values are converted into a vector value. The offers are paired and the vectors subtracted from one another, resulting in a pair vector. Metrics for the success of offers is collected, and are subtracted from one another for the paired offers to generate a raw score. This raw score is then normalized using the pair vector. The normalized scores are utilized to generate a model for the impact any variable value has on offer success, which may then be applied, using linear regression, to new offers to generate an expected level of success. The new scored offers are ranked and the top-ranked offers are selected for inclusion in a promotional campaign.

Claims (54)

1 . A method comprising:

accessing, by one or more processors, a first set of candidate content items, wherein each candidate content item in the first set of candidate content items includes a variable value for each of a plurality of variables;

generating, by one or more processors, a content item vector for each content item in the first set of candidate content items, wherein each content item vector includes the variable values for the corresponding candidate content item of the first set of candidate content items, and wherein each content item vector includes a success metric for the candidate content item;

generating, by one or more processors, a derivative table based on the generated content item vectors, wherein the derivative table comprises a plurality of differential vectors, wherein each differential vector comprises pair-wise differences between variable values for a pair of the generated content item vectors and a differential success score representing a difference of the success metrics of the pair of generated content item vectors;

training, by one or more processors, a machine-learning model based on the derivative table;

receiving a content item from a client device, wherein the content item includes a variable value for each of the plurality of variables;

generating, by one or more processors, a content item vector for the content item, wherein the content item vector includes the variable values for the content item;

computing, by one or more processors, a score for the content item by applying the machine-learning model to the content item vector for the content item; and

responsive to the computed score exceeding a threshold, transmitting, by one or more processors, the content item to a plurality of users.

2 . The method of claim 1 , further comprising:

selecting an additional set of content items by computing an orthogonality of the content item vector to the content item vectors of the additional set of content items; and

transmitting the additional set of content items to the plurality of users.

3 . The method of claim 2 , wherein computing an orthogonality of the content item vectors comprises:

generating a matrix comprising variable values corresponding to the content item and variable values corresponding to the additional set of content items; and

optimizing for a maximum determinant of the matrix by selecting the additional set of content items to maximize the determinant of the matrix.

4 . The method of claim 1 , further comprising:

computing a score for a plurality of content items by applying the machine-learning model to content item vectors for the plurality of content items;

ranking the plurality of content items based on the computed scores; and

selecting the content item based on the ranking.

5 . The method of claim 1 , wherein transmitting the content item to a plurality of users comprises transmitting the content item to a set of segmented users.

6 . The method of claim 1 , wherein the machine-learning model comprises a neural network or a decision tree.

7 . The method of claim 1 , wherein the machine-learning model is trained by:

receiving an initial set of content items; and

generating a set of content items for training the machine-learning model by applying a set of heuristics to filter the initial set of content items.

8 . The method of claim 7 , wherein the initial set of content items comprises a content item for each possible combination of variable values for the plurality of variables.

9 . The method of claim 7 , wherein the set of heuristics comprises a user-defined heuristic.

10 . The method of claim 1 , wherein the success metric for a content item is based on a clip rate of the content item.

11 . A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to perform operations comprising:

accessing, by one or more processors, a first set of candidate content items, wherein each candidate content item in the first set of candidate content items includes a variable value for each of a plurality of variables;

generating, by one or more processors, a content item vector for each content item in the first set of candidate content items, wherein each content item vector includes the variable values for the corresponding candidate content item of the first set of candidate content items, and wherein each content item vector includes a success metric for the candidate content item;

generating, by one or more processors, a derivative table based on the generated content item vectors, wherein the derivative table comprises a plurality of differential vectors, wherein each differential vector comprises pair-wise differences between variable values for a pair of the generated content item vectors and a differential success score representing a difference of the success metrics of the pair of generated content item vectors;

training, by one or more processors, a machine-learning model based on the derivative table;

receiving a content item from a client device, wherein the content item includes a variable value for each of the plurality of variables;

generating, by one or more processors, a content item vector for the content item, wherein the content item vector includes the variable values for the content item;

computing, by one or more processors, a score for the content item by applying the machine-learning model to the content item vector for the content item; and

responsive to the computed score exceeding a threshold, transmitting, by one or more processors, the content item to a plurality of users.

12 . The computer-readable medium of claim 11 , the operations further comprising:

selecting an additional set of content items by computing an orthogonality of the content item vector to the content item vectors of the additional set of content items; and

transmitting the additional set of content items to the plurality of users.

13 . The computer-readable medium of claim 12 , wherein computing an orthogonality of the content item vectors comprises:

generating a matrix comprising variable values corresponding to the content item and variable values corresponding to the additional set of content items; and

optimizing for a maximum determinant of the matrix by selecting the additional set of content items to maximize the determinant of the matrix.

14 . The computer-readable medium of claim 11 , the operations further comprising:

computing a score for a plurality of content items by applying the machine-learning model to content item vectors for the plurality of content items;

ranking the plurality of content items based on the computed scores; and

selecting the content item based on the ranking.

15 . The computer-readable medium of claim 11 , wherein transmitting the content item to a plurality of users comprises transmitting the content item to a set of segmented users.

16 . The computer-readable medium of claim 11 , wherein the machine-learning model comprises a neural network or a decision tree.

17 . The computer-readable medium of claim 11 , wherein the machine-learning model is trained by:

receiving an initial set of content items; and

generating a set of content items for training the machine-learning model by applying a set of heuristics to filter the initial set of content items.

18 . The computer-readable medium of claim 17 , wherein the initial set of content items comprises a content item for each possible combination of variable values for the plurality of variables.

19 . The computer-readable medium of claim 17 , wherein the set of heuristics comprises a user-defined heuristic.

20 . The computer-readable medium of claim 11 , wherein the success metric for a content item is based on a clip rate of the content item.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2024
From: MONTERO, MICHAEL
To: EVERSIGHT, INC.
Reel/Frame 066517/0644 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2024
From: EVERSIGHT, INC.
To: MAPLEBEAR INC.
Reel/Frame 066517/0869 →
Continuity (4)
Continuation 18295767 · Apr 4, 2023
Continuation 17240299 · Apr 26, 2021
Continuation 15597132 · May 16, 2017
Related Publication 20240193637A1 · Jun 13, 2024
References Cited (307)
US 6084583A · Gerszberg et al. · 2000 [cited by applicant]
US 6577982B1 · Erb · 2003 [cited by applicant]
US 7092436B2 · Ma et al. · 2006 [cited by applicant]
US 7152040B1 · Hawthorne et al. · 2006 [cited by applicant]
US 7158959B1 · Chickering et al. · 2007 [cited by applicant]
US 7200527B1 · Davidov et al. · 2007 [cited by applicant]
US 7254547B1 · Beck et al. · 2007 [cited by applicant]
US 7360698B1 · Wyker · 2008 [cited by applicant]
US 7376603B1 · Mayr et al. · 2008 [cited by applicant]
US 7379890B2 · Myr et al. · 2008 [cited by applicant]
US 7406434B1 · Chang · 2008 [cited by examiner]
US 7639727B1 · Brisebois et al. · 2009 [cited by applicant]
US 7660734B1 · Neal et al. · 2010 [cited by applicant]
US 7912748B1 · Rosenberg et al. · 2011 [cited by applicant]
US 7962363B2 · Patel et al. · 2011 [cited by applicant]
US 7996331B1 · Solanki et al. · 2011 [cited by applicant]
US 8140381B1 · Wu et al. · 2012 [cited by applicant]
US 8140402B1 · Mesaros · 2012 [cited by applicant]
US 8606626B1 · DeSoto et al. · 2013 [cited by applicant]
US 8676632B1 · Watson et al. · 2014 [cited by applicant]
US 8972391B1 · McDonnell et al. · 2015 [cited by applicant]
US 9418341B1 · Kadarkarai · 2016 [cited by applicant]
US 9639842B1 · Green et al. · 2017 [cited by applicant]
US 9947022B1 · Shariff · 2018 [cited by examiner]
US 10255620B1 · Koren et al. · 2019 [cited by applicant]
US 10497018B1 · Sullivan et al. · 2019 [cited by applicant]
US 10580035B2 · Mehanian et al. · 2020 [cited by applicant]
US 12014389B2 · Ventrice et al. · 2024 [cited by applicant]
US 20010014868A1 · Herz et al. · 2001 [cited by applicant]
US 20010018665A1 · Sullivan et al. · 2001 [cited by applicant]
US 20020007329A1 · Alcaly et al. · 2002 [cited by applicant]
US 20020010620A1 · Kowalchuk et al. · 2002 [cited by applicant]
US 20020023117A1 · Bernardin et al. · 2002 [cited by applicant]
US 20020026351A1 · Coleman · 2002 [cited by applicant]
US 20020087453A1 · Nicolaisen et al. · 2002 [cited by applicant]
US 20020123930A1 · Boyd et al. · 2002 [cited by applicant]
US 20020147639A1 · Williams et al. · 2002 [cited by applicant]
US 20020161641A1 · Quinlan et al. · 2002 [cited by applicant]
US 20020165834A1 · Delurgio et al. · 2002 [cited by applicant]
US 20020169700A1 · Huffman et al. · 2002 [cited by applicant]
US 20020184086A1 · Linde · 2002 [cited by applicant]
US 20020194051A1 · Hall et al. · 2002 [cited by applicant]
US 20030046203A1 · Ichihari et al. · 2003 [cited by applicant]
US 20030105695A1 · Ikeda et al. · 2003 [cited by applicant]
US 20030110074A1 · Vives · 2003 [cited by applicant]
US 20030120577A1 · Sakui et al. · 2003 [cited by applicant]
US 20030130580A1 · Kenyon · 2003 [cited by applicant]
US 20030130883A1 · Schroeder et al. · 2003 [cited by applicant]
US 20030149938A1 · McElfresh et al. · 2003 [cited by applicant]
US 20030204437A1 · Flender et al. · 2003 [cited by applicant]
US 20030233246A1 · Snapp et al. · 2003 [cited by applicant]
US 20040073520A1 · Eskandari · 2004 [cited by applicant]
US 20040093542A1 · Isodono et al. · 2004 [cited by applicant]
US 20040123247A1 · Wachen et al. · 2004 [cited by applicant]
US 20040133457A1 · Sadiq et al. · 2004 [cited by applicant]
US 20040148211A1 · Honarvar et al. · 2004 [cited by applicant]
US 20040210542A1 · Sweeney · 2004 [cited by applicant]
US 20040223648A1 · Hoene et al. · 2004 [cited by applicant]
US 20040249652A1 · Aldstadt · 2004 [cited by applicant]
US 20050027594A1 · Yasnovsky et al. · 2005 [cited by applicant]
US 20050096963A1 · Myr et al. · 2005 [cited by applicant]
US 20050189415A1 · Fano et al. · 2005 [cited by applicant]
US 20050201312A1 · Archacki · 2005 [cited by applicant]
US 20050246206A1 · Obora et al. · 2005 [cited by applicant]
US 20050256778A1 · Boyd et al. · 2005 [cited by applicant]
US 20050273376A1 · Ouimet et al. · 2005 [cited by applicant]
US 20050273380A1 · Schroeder et al. · 2005 [cited by applicant]
US 20060080265A1 · Hinds et al. · 2006 [cited by applicant]
US 20060163349A1 · Neugebauer · 2006 [cited by applicant]
US 20060167917A1 · Solomon · 2006 [cited by applicant]
US 20060259835A1 · Marinissen et al. · 2006 [cited by applicant]
US 20060271671A1 · Hansen · 2006 [cited by applicant]
US 20070022003A1 · Chao et al. · 2007 [cited by applicant]
US 20070038516A1 · Apple · 2007 [cited by examiner]
US 20070073585A1 · Apple et al. · 2007 [cited by applicant]
US 20070094077A1 · Hallbauer et al. · 2007 [cited by applicant]
US 20070094093A1 · Hallbauer et al. · 2007 [cited by applicant]
US 20070118419A1 · Maga et al. · 2007 [cited by applicant]
US 20070143186A1 · Apple et al. · 2007 [cited by applicant]
US 20070174030A1 · Yun et al. · 2007 [cited by applicant]
US 20070282668A1 · Cereghini et al. · 2007 [cited by applicant]
US 20080021909A1 · Black et al. · 2008 [cited by applicant]
US 20080033784A1 · Chalimadugu et al. · 2008 [cited by applicant]
US 20080033808A1 · Black et al. · 2008 [cited by applicant]
US 20080077459A1 · Desai et al. · 2008 [cited by applicant]
US 20080126264A1 · Tellefsen et al. · 2008 [cited by applicant]
US 20080140502A1 · Birnholz et al. · 2008 [cited by applicant]
US 20080189156A1 · Voda et al. · 2008 [cited by applicant]
US 20080276270A1 · Kotaru et al. · 2008 [cited by applicant]
US 20080305460A1 · Garg · 2008 [cited by applicant]
US 20080306830A1 · Lasa et al. · 2008 [cited by applicant]
US 20090017913A1 · Bell et al. · 2009 [cited by applicant]
US 20090030785A1 · Goyal et al. · 2009 [cited by applicant]
US 20090030829A1 · Chatter et al. · 2009 [cited by applicant]
US 20090083121A1 · Angell et al. · 2009 [cited by applicant]
US 20090132447A1 · Milenova et al. · 2009 [cited by applicant]
US 20090204472A1 · Einhorn · 2009 [cited by applicant]
US 20090210286A1 · Bisdikian · 2009 [cited by applicant]
US 20090254413A1 · Chang et al. · 2009 [cited by applicant]
US 20090259523A1 · Rapperport et al. · 2009 [cited by applicant]
US 20090271275A1 · Regmi et al. · 2009 [cited by applicant]
US 20090282343A1 · Catlin et al. · 2009 [cited by applicant]
US 20090288012A1 · Hertel et al. · 2009 [cited by applicant]
US 20090292588A1 · Duzevik et al. · 2009 [cited by applicant]
US 20090292771A1 · Bertoni et al. · 2009 [cited by applicant]
US 20090304232A1 · Tsukizawa · 2009 [cited by applicant]
US 20090307073A1 · MirrokniBanadaki et al. · 2009 [cited by applicant]
US 20090313109A1 · Bo et al. · 2009 [cited by applicant]
US 20100100419A1 · Natoli · 2010 [cited by examiner]
US 20100106605A1 · Lin et al. · 2010 [cited by applicant]
US 20100145773A1 · Desai et al. · 2010 [cited by applicant]
US 20100153332A1 · Rollins et al. · 2010 [cited by applicant]
US 20100175084A1 · Ellis et al. · 2010 [cited by applicant]
US 20100179855A1 · Chen et al. · 2010 [cited by applicant]
US 20100217631A1 · Boss et al. · 2010 [cited by applicant]
US 20100250477A1 · Yadav · 2010 [cited by examiner]
US 20100250714A1 · Wehmann et al. · 2010 [cited by applicant]
US 20100274661A1 · Aaltonen et al. · 2010 [cited by applicant]
US 20100282836A1 · Kempf et al. · 2010 [cited by applicant]
US 20100306031A1 · McCauley et al. · 2010 [cited by applicant]
US 20110029360A1 · Gollapalli · 2011 [cited by applicant]
US 20110035379A1 · Chen et al. · 2011 [cited by applicant]
US 20110040756A1 · Jones et al. · 2011 [cited by applicant]
US 20110045831A1 · Chiu et al. · 2011 [cited by applicant]
US 20110119100A1 · Ruhl et al. · 2011 [cited by applicant]
US 20110119155A1 · Hammad et al. · 2011 [cited by applicant]
US 20110161113A1 · Rumak et al. · 2011 [cited by applicant]
US 20110161973A1 · Klots et al. · 2011 [cited by applicant]
US 20110173055A1 · Ross et al. · 2011 [cited by applicant]
US 20110196733A1 · Li et al. · 2011 [cited by applicant]
US 20110246994A1 · Kimbrel et al. · 2011 [cited by applicant]
US 20110251880A1 · Butler et al. · 2011 [cited by applicant]
US 20110258049A1 · Ramer et al. · 2011 [cited by applicant]
US 20110295722A1 · Reisman · 2011 [cited by applicant]
US 20110313835A1 · Falkenborg et al. · 2011 [cited by applicant]
US 20120022930A1 · Brouhard · 2012 [cited by applicant]
US 20120022938A1 · McNea · 2012 [cited by examiner]
US 20120022944A1 · Volpi · 2012 [cited by applicant]
US 20120100134A1 · Lenz · 2012 [cited by applicant]
US 20120150576A1 · Wagenblatt · 2012 [cited by applicant]
US 20120158099A1 · Lee · 2012 [cited by applicant]
US 20120158474A1 · Fahner · 2012 [cited by examiner]
US 20120191534A1 · Tavares et al. · 2012 [cited by applicant]
US 20120221372A1 · Vasko · 2012 [cited by applicant]
US 20120239537A1 · Baker et al. · 2012 [cited by applicant]
US 20120259698A1 · Yurow · 2012 [cited by applicant]
US 20120264089A1 · Hoang et al. · 2012 [cited by applicant]
US 20120290399A1 · England et al. · 2012 [cited by applicant]
US 20120303411A1 · Chen et al. · 2012 [cited by applicant]
US 20130006949A1 · Essawi et al. · 2013 [cited by applicant]
US 20130013404A1 · Suprock et al. · 2013 [cited by applicant]
US 20130030868A1 · Lyon et al. · 2013 [cited by applicant]
US 20130036015A1 · Bender et al. · 2013 [cited by applicant]
US 20130046605A1 · Baron et al. · 2013 [cited by applicant]
US 20130073388A1 · Heath · 2013 [cited by applicant]
US 20130085838A1 · Tennenholtz et al. · 2013 [cited by applicant]
US 20130085844A1 · Neystadt et al. · 2013 [cited by applicant]
US 20130091019A1 · Mallon et al. · 2013 [cited by applicant]
US 20130097006A1 · Evans et al. · 2013 [cited by applicant]
US 20130110641A1 · Ormont et al. · 2013 [cited by applicant]
US 20130110880A1 · Farchi et al. · 2013 [cited by applicant]
US 20130124257A1 · Schubert · 2013 [cited by applicant]
US 20130124361A1 · Bryson · 2013 [cited by applicant]
US 20130138812A1 · Assuncao et al. · 2013 [cited by applicant]
US 20130148813A1 · Strelcyk et al. · 2013 [cited by applicant]
US 20130151332A1 · Yan et al. · 2013 [cited by applicant]
US 20130185147A1 · Letca et al. · 2013 [cited by applicant]
US 20130226691A1 · Chatow et al. · 2013 [cited by applicant]
US 20130238416A1 · Richard · 2013 [cited by applicant]
US 20130238617A1 · Postrel · 2013 [cited by applicant]
US 20130246217A1 · Denton et al. · 2013 [cited by applicant]
US 20130254151A1 · Mohagheghi et al. · 2013 [cited by applicant]
US 20130290096A1 · Lizotte · 2013 [cited by applicant]
US 20130297543A1 · Treiser · 2013 [cited by applicant]
US 20130331999A1 · Vaughn et al. · 2013 [cited by applicant]
US 20130346302A1 · Purves et al. · 2013 [cited by applicant]
US 20140006129A1 · Heath · 2014 [cited by applicant]
US 20140019228A1 · Aggarwal et al. · 2014 [cited by applicant]
US 20140025391A1 · Knowles et al. · 2014 [cited by applicant]
US 20140040007A1 · Relyea et al. · 2014 [cited by applicant]
US 20140046757A1 · Kahn et al. · 2014 [cited by applicant]
US 20140046872A1 · Arnott et al. · 2014 [cited by applicant]
US 20140074595A1 · Chomsky et al. · 2014 [cited by applicant]
US 20140081636A1 · Erhart et al. · 2014 [cited by applicant]
US 20140081722A1 · Schacht · 2014 [cited by applicant]
US 20140081741A1 · Katsur · 2014 [cited by applicant]
US 20140095281A1 · Weiss et al. · 2014 [cited by applicant]
US 20140095410A1 · Chen et al. · 2014 [cited by applicant]
US 20140095611A1 · Weinstein et al. · 2014 [cited by applicant]
US 20140122200A1 · Granville · 2014 [cited by applicant]
US 20140136537A1 · Nelson et al. · 2014 [cited by applicant]
US 20140143405A1 · Pavlidis et al. · 2014 [cited by applicant]
US 20140180790A1 · Boal · 2014 [cited by applicant]
US 20140180809A1 · Boal · 2014 [cited by applicant]
US 20140180811A1 · Boal · 2014 [cited by applicant]
US 20140236706A1 · Opie et al. · 2014 [cited by applicant]
US 20140278786A1 · Liu-Qiu-Yan · 2014 [cited by applicant]
US 20140278798A1 · Goyal et al. · 2014 [cited by applicant]
US 20140330633A1 · Moran · 2014 [cited by examiner]
US 20140330636A1 · Moran et al. · 2014 [cited by applicant]
US 20140337120A1 · Ercanbrack · 2014 [cited by applicant]
US 20140344051A1 · Ouimet · 2014 [cited by applicant]
US 20150019325A1 · Li et al. · 2015 [cited by applicant]
US 20150046251A1 · Smith · 2015 [cited by applicant]
US 20150049924A1 · Tang et al. · 2015 [cited by applicant]
US 20150050970A1 · Racho · 2015 [cited by applicant]
US 20150058087A1 · Kulagin et al. · 2015 [cited by applicant]
US 20150117631A1 · Tuchman et al. · 2015 [cited by applicant]
US 20150120467A1 · Hermida et al. · 2015 [cited by applicant]
US 20150142557A1 · Krishnamurthy et al. · 2015 [cited by applicant]
US 20150150023A1 · Johnson et al. · 2015 [cited by applicant]
US 20150248630A1 · Ramanan et al. · 2015 [cited by applicant]
US 20150310188A1 · Ford et al. · 2015 [cited by applicant]
US 20150317682A1 · Kayser et al. · 2015 [cited by applicant]
US 20150332208A1 · Scott et al. · 2015 [cited by applicant]
US 20150332308A1 · Liu · 2015 [cited by applicant]
US 20160155193A1 · Merrill et al. · 2016 [cited by applicant]
US 20160162931A1 · Harik et al. · 2016 [cited by applicant]
US 20160189278A1 · Parpia et al. · 2016 [cited by applicant]
US 20160321705A1 · Scheidelman · 2016 [cited by applicant]
US 20170032407A1 · Moran · 2017 [cited by applicant]
US 20170053305A1 · Montero et al. · 2017 [cited by applicant]
US 20170098257A1 · Keller · 2017 [cited by applicant]
US 20170109767A1 · Shpanya et al. · 2017 [cited by applicant]
US 20170140603A1 · Ricci · 2017 [cited by applicant]
US 20170161791A1 · Zaheer et al. · 2017 [cited by applicant]
US 20170249664A1 · Harik et al. · 2017 [cited by applicant]
US 20170345096A1 · Umblijs et al. · 2017 [cited by applicant]
US 20180068340A1 · Jaidka · 2018 [cited by examiner]
US 20180108035A1 · Tiwari · 2018 [cited by applicant]
US 20180211272A1 · Deshpande et al. · 2018 [cited by applicant]
US 20180336597A1 · Singh et al. · 2018 [cited by applicant]
US 20180341897A1 · Ames · 2018 [cited by applicant]
US 20190080361A1 · Green · 2019 [cited by applicant]
US 20190108538A1 · Montero et al. · 2019 [cited by applicant]
US 20190147425A1 · Sundholm · 2019 [cited by applicant]
US 20190180302A1 · Ventrice et al. · 2019 [cited by applicant]
US 20190347681A1 · Liu et al. · 2019 [cited by applicant]
US 20200019922A1 · Harsha et al. · 2020 [cited by applicant]
US 20210103945A1 · Montero et al. · 2021 [cited by applicant]
US 20210110429A1 · Keng et al. · 2021 [cited by applicant]
US 20210142387A1 · Gupta et al. · 2021 [cited by applicant]
JP 2001338116A · 2001 [cited by applicant]
JP 2002203021A · 2002 [cited by applicant]
JP 2004519021A · 2004 [cited by applicant]
JP 2005529412A · 2005 [cited by applicant]
WO WO9407239A1 · 1994 [cited by applicant]
WO WO2013055634A1 · 2013 [cited by applicant]
WO WO2018200546A1 · 2018 [cited by applicant]
WO WO2018213019A1 · 2018 [cited by applicant]
“Deep CTR Prediction in Display Advertising” (Junxuan Chen, et al, Publication: MM '16: Proceedings of the 24th ACM international conference on Multimedia Oct. 2016 pp. 811-820 https://doi.org/10.1145/2964284.2964325) (… [cited by examiner]
Boughzala, I. et al. “Characterization and Evaluation of Serious Games: A Perspective of Their Use in Higher Education,” 46th Hawaii International Conference on System Sciences, Jan. 7-10, 2013, pp. 844-852. [cited by applicant]
Campbell, N. R. “Physics: The Elements,” Cambridge University Press, 1920, pp. 267-293. [cited by applicant]
Chen, J. et al., Deep CTR Prediction in Display Advertising, 24th ACM International Conference on Multimedia, Oct. 2016, pp. 811-820. [cited by applicant]
David, B. et al. “Collaborative Systems & Shared Economy (Uberization): Principles & Case Study,” International Conference on Collaboration Technologies and Systems, 2016, pp. 57-63. [cited by applicant]
Dumitrascu, B. et al. “PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits,” Advances in Neural Information Processing Systems, 32nd Conference on Neural Information Processing Systems, Montreal, Canada, 2… [cited by applicant]
European Patent Office, Extended European Search Report and Opinion, EP Patent Application No. 18851705.6, Jan. 15, 2021, seven pages. [cited by applicant]
European Patent Office, Extended European Search Report and Opinion, EP Patent Application No. 19871600.3, May 25, 2022, eight pages. [cited by applicant]
Fasuga, R. et al. “An Intelligent Tool for All-to-All Sales on the Internet: Platform for Compilation of Commercial Offers and Requests for Companies and Customers,” 12th International Joint Conference on e- Business an… [cited by applicant]
Goebel, C. et al. “The Information Value of Item-Level RFID in Retail Supply Chain Operations,” 44th Hawaii International Conference on System Sciences, Feb. 2011, pp. 1-10. [cited by applicant]
Goldberg, S. et al. “Conjoint analysis of price premiums for hotel amenities,” Journal of Business, Jan. 1, 1984, pp. S111-S132. [cited by applicant]
Green, P. et al. “Conjoint Analysis in Consumer Research: Issues and Outlook,” Journal of Consumer Research, vol. 5, No. 2, Sep. 1978, pp. 103-123. [cited by applicant]
Hoch, S. J. et al. “Determinants of Store-Level Price Elasticity,” Journal of Marketing Research, vol. 32, No. 1, Feb. 1995, pp. 17-29. [cited by applicant]
Huang, S. et al. “Strategy, Model, and Platform for Collaborative Commerce,” IEEE International Conference on e-Business Engineering, Oct. 24-26, 2007, pp. 304-311. [cited by applicant]
Katsov, I. “Predictive Analytics for Promotion and Price Optimization,” Aug. 7, 2018. [cited by applicant]
Liu, X. “Dynamic coupon targeting using batch deep reinforcement learning: An application to livestream shopping,” Marketing Science, vol. 42, No. 4, Jul. 2023, 62 pages. [cited by applicant]
Madansky, A. “On Conjoint Analysis and Quantal Choice Models,” University of Chicago Press, Journal of Business, vol. 53, No. 3, Jul. 1980, pp. S37-S44. [cited by applicant]
Molina, A. et al., “Next-generation manufacturing systems: key research issues in developing and integrating reconfigurable and intelligent machines,” International Journal of Computer Integrated Manufacturing, Feb. 19,… [cited by applicant]
Nafari, M. et al. “A Data Mining Approach for Finding Optimal Discount of Retail Assortments,” 11th International Conference on Computer and Information Technology, Dec. 24-28, 2008, pp. 20-27. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2018/030985, Aug. 24, 2018, 7 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2018/049284, Nov. 30, 2018, 8 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2018/057409, Jan. 16, 2019, 6 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2019/055259, Dec. 26, 2019, 15 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2022/012206, Apr. 12, 2022, 22 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US22/30392, Sep. 9, 2022, 12 pages. [cited by applicant]
Rao, V. R. “Applied Conjoint Analysis,” New York: Springer, 2014. [cited by applicant]
Schrage, M. “The Innovator's Hypothesis: How Cheap Experiments Are Worth More Than Good Ideas,” MIT Press, 2014, pp. 103-111. [cited by applicant]
Sen, S. et al. “Incentivizing Time-Shifting of Data: A Survey of Time-Dependent Pricing for Internet Access,” IEEE Communications Magazine, vol. 50, No. 11, Nov. 2012, pp. 91-99. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Aug. 4, 2021, 24 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Jan. 21, 2021, 26 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Jun. 24, 2022, 25 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Mar. 16, 2022, 24 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Mar. 16, 2023, 37 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Mar. 5, 2020, 27 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Nov. 1, 2019, 27 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Nov. 28, 2022, 19 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Nov. 8, 2021, 24 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 16/120,178, filed Sep. 14, 2020, 26 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/076,802, filed Feb. 17, 2023, 20 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/076,802, filed Jul. 12, 2022, 12 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/076,802, filed Mar. 30, 2022, 18 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/240,299, filed Mar. 14, 2022, 19 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/240,299, filed Sep. 19, 2022, 21 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/573,620, filed Aug. 3, 2022, 21 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/585,526, filed Nov. 28, 2022, six pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/665,504, filed Oct. 21, 2022, nine pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/670,402, filed Mar. 16, 2023, 23 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/670,402, filed Nov. 28, 2022, 14 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/676,095, filed Mar. 16, 2023, 25 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/676,095, filed Nov. 29, 2022, 13 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/749,041, filed Jan. 30, 2023, 30 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/749,041, filed May 11, 2023, 34 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/749,041, filed Oct. 19, 2023, 25 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 18/159,249, filed Oct. 26, 2023, 31 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 18/182,355, filed Oct. 19, 2023, 23 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 18/159,249, filed Apr. 8, 2024, 29 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 18/634,967, filed Jun. 10, 2025, 27 pages. [cited by applicant]