公开(公告)号：US11367118B1

公开(公告)日：2022-06-21

申请号：US16198341

申请日：2018-11-21

Applicant: Amazon Technologies, Inc.

Inventor： Dale Struble ,  Rahul Makhijani ,  Yi Liu ,  Shreya Chakrabarti

IPC: G06Q30/00 ,  G06Q30/06

Abstract: Techniques are provided for optimizing a graph. The graph can be generated with a source node, a plurality of item nodes, and a terminal node. Once generated, the graph can be optimized to determine a lowest cost flow from the source node to the terminal node based at least in part on respective budget measurements. A first account node and a first item node can be determined and an account corresponding to the first account node, as well as information that identifies an item corresponding to the first item node can be transmitted.

公开(公告)号：US11126785B1

公开(公告)日：2021-09-21

申请号：US15436359

申请日：2017-02-17

Applicant: Amazon Technologies, Inc.

Inventor： Houssam Nassif ,  Daniel Hill ,  Tao Hu ,  Anand Mahadeva Iyer ,  Jian Liu ,  Yi Liu ,  Sriram Srinivasan ,  Vishwanathan Swaminathan

IPC: G06F40/106 ,  G06N7/00 ,  G06F40/14

Abstract: An optimal combination of content items may be determined and served to increase the likelihood of a predefined user interaction. A user can request content which may include an entity (such as a web page, document, advertisement, and the like) that has multiple components through which content items may be provided. For example, a web page may include multiple slots where content items may be displayed on the web page. Each component may be associated with multiple possible content items, resulting in many combinations of layouts for an entity. A content server may determine which layout to provide using a content selection model that is weighted based on a likelihood of groupings of content items resulting in a user interaction that satisfies a success condition (e.g., selecting a hyperlink, selecting a content item, initiating a transaction, etc.).

公开(公告)号：US11748647B1

公开(公告)日：2023-09-05

申请号：US16708341

申请日：2019-12-09

Applicant: Amazon Technologies, Inc.

Inventor： Wenjun Zeng ,  Yi Liu ,  Zachary Wake Austin ,  Hau Wing Calvin Kwok

IPC: G06F16/958 ,  G06N20/20 ,  G06N7/01 ,  G06N3/047 ,  G06N5/01 ,  G06Q30/0241 ,  G06Q20/12

CPC classification number: G06N7/01 ,  G06F16/958 ,  G06N3/047 ,  G06N5/01 ,  G06N20/20 ,  G06Q20/127 ,  G06Q30/0277

Abstract: Technologies are provided for the generating of optimal policies for bidding in auctions having unknown dynamics. In some embodiments, a computing system can configure many multi-armed bandit (MAB) models defining candidate directed contents for a sequence of pages. A particular MAB model of the many MAB models defines candidate directed contents for a particular page in the sequence of pages, where each arm in the particular MAB model corresponds to a candidate impression on the particular page. The computing system can then determine a solution to an optimization problem with respect to an objective function based on an expected long-term reward for a defined impression on the first page, a defined impression on the second page, and a defined impression on the third page. The solution results in respective directed content for presentation on the first, second, and third pages.