# US 2012/0252574 A1 · Matching advertising to game play content

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0252574 A1
- Document ID: US20120252574A1
- Status: Published application
- Kind: A1
- Application number: 13/244,858
- Filed: 2011-09-26
- Published: 2012-10-04
- Earliest claimed: 2011-04-04
- Assignees: Zynga Inc.
- Inventors: Michael Chow; Justin Rouse; Kevin Holme
- Web page: https://patentgrep.com/patent/US20120252574A1

## CPC

- G06Q 30/0251: Targeted advertisements
- H04L 67/131: Protocols for games, networked simulations or virtual reality
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An advertisement is associated with a particular user move in a gaming environment where playing of the user move by a user results in the advertisement being displayed at the user's gaming device. With multiple users, each play of a unique user move results in a corresponding uniquely targeted advertisement being displayed at the respective gaming device of each user. User moves and associated advertisements are bound to one another based on a frequency of use of the user move in game play and the desirability of the advertiser to associate the advertisement with the user move.

## Claims

### Claim 1

A computer-implemented method comprising:
receiving a play, including certain moves having a respective selection criterion, from a game on a client device;
determining, with at least one processor, that each of the certain moves in the play corresponds to an advertisement trigger for an advertisement message;
determining an advertisement message having a greatest economic benefit from among the advertisement messages based on the respective selection criterion; and
transmitting the determined advertisement message to the client device.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the play is produced according to user moves initiated at the client device by a player.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the client device is preconfigured with advertisement messages and stored plays as advertisement triggers associated to the advertisement messages.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the stored plays and the advertisement messages are stored in a storage module of the client device.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, further comprising associating advertisement messages with plays based on a characteristic of the advertisement messages and a characteristic of the plays.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the plays are produced without requiring the client device to be communicatively coupled to a network.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein a play includes at least one move from one or more players in one or more instances of the computer-implemented game.

### Claim 8

(canceled)

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the advertisement messages and advertisement triggers are delivered during a pre-configuration of the computer-implemented game and prior to initiating an instance of the computer-implemented game.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, further comprising determining that the play corresponds to the advertisement trigger and displaying a further advertisement message associated with the play in a further computer-implemented game.

### Claim 11

A non-transitory computer-readable storage medium embodying a set of instructions, that when executed by at least one processor, causes the at least one processor to perform operations comprising:
receiving a play, including certain moves having a respective selection criterion, from a game on a client device;
determining, with at least one processor, that each of the certain moves in the play corresponds to an advertisement trigger for an advertisement message;
determining an advertisement message having a greatest economic benefit from among the advertisement messages based on the respective selection criterion; and
transmitting the determined advertisement message to the client device.

### Claim 12 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the play is produced according to user moves initiated at the client device by a player.

### Claim 13 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the client device is preconfigured with advertisement messages and stored plays as advertisement triggers associated to the advertisement messages.

### Claim 14 (depends on 13)

The non-transitory computer-readable storage medium of claim 13, wherein the stored plays and the advertisement messages are stored in a storage module of the client device.

### Claim 15 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, the operations further comprising associating advertisement messages with plays based on a characteristic of the advertisement messages and a characteristic of the plays.

### Claim 16 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the plays are produced without requiring the client device to be communicatively coupled to a network.

### Claim 17 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein a play includes at least one move from one or more players in one or more instances of the computer-implemented game.

### Claim 18 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the advertisement messages are bound to plays and advertisement triggers within the computer-implemented game is fulfilled in an ad campaign.

### Claim 19 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, the operations further comprising determining that the play corresponds to the advertisement trigger and displaying a further advertisement message associated with the play in a further computer-implemented game.

### Claim 20

A system comprising:
a game play device configured to provide game play interaction to a user initiating user moves on the game play device;
a determination module configured to determine an advertisement message having a greatest economic benefit based on selection criteria provided during game play;
a game data storage module configured to store advertisement messages, selection criterion, and plays, the plays being advertisement triggers associated to the advertisement messages; and
an association module configured to associate an advertisement message with plays based on a characteristic of the advertisement message and a characteristic of a respective play.

### Claim 21 (depends on 1)

The computer-implemented method of claim 1, wherein the selection criterion used in the determining an advertisement message having a greatest economic benefit is at least one of a maximum price per click associated with a respective one of the plurality of advertisement triggers, a maximum advertisement purchase price, and a maximum price paid to purchase a corresponding advertising campaign.
