# US 2024/0348886 A1 · System and Method for Personalized Media Selection

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

- Number: US 2024/0348886 A1
- Document ID: US20240348886A1
- Status: Published application
- Kind: A1
- Application number: 18/634,072
- Filed: 2024-04-12
- Published: 2024-10-17
- Earliest claimed: 2023-04-13
- Inventors: Peter NAGLE
- Web page: https://patentgrep.com/patent/US20240348886A1

## CPC

- H04N 21/482: End-user interface for programme selection
- B24B 3/36: of cutting blades (B24B3/58 takes precedence)
- B24B 3/38: for planing wood, e.g. cutter blades
- B24B 3/46: of disc blades
- B24B 51/00: Arrangements for automatic control of a series of individual steps in grinding a workpiece (if applicable to other machine tools, G05B takes precedence)
- G06Q 30/0624: {using guided investigation, e.g. hierarchical browsing of shopping information}
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- B24B: MACHINES, DEVICES, OR PROCESSES FOR GRINDING OR POLISHING (grinding of gear teeth B23F, of screw-threads B23G1/36; by electro-erosion B23H; abrasive or related blasting B24C; tools for grinding, buffing or sharpening B24D; polishing compositions C09G1/00; abrasives C09K3/14; electrolytic etching or polishing C25F3/00; grinding arrangements for use on assembled railway tracks E01B31/17); DRESSING OR CONDITIONING OF ABRADING SURFACES; FEEDING OF GRINDING, POLISHING, OR LAPPING AGENTS
- 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

## Abstract

Methods of selecting one item from a population of items are presented. The methods use a sequence of binary choices to make the selection process more efficient. One such method is a tournament bracket type in which those chosen from each round are pitted against each other, and the victor moves to a subsequent round. In another, the victor of an initial selection is pitted against other options until the population is exhausted or the victor is replaced. In another method, each of the two choices are ranked by the degree of the users preference, and these rankings are used to construct further pairwise choices.

## Claims

### Claim 1

A method for selecting a member of a set by a user comprising the steps of:
a. Selecting two members of a set of unselected items,
b. Presenting the pair of members of the set to a user,
c. Prompting the user to choose a selected member from one of the two members of the set,
d. Rejecting the unselected member of the pair,
e. Selecting another two members of the set,
f. Presenting the second pair of members to a user,
g. Prompting the user to choose a selected member from one of the newly presented members of the set,
h. Rejecting the unselected member of the pair,
i. Continuing to make pairwise selections between unselected and selected members of the set until all set members are either selected or rejected.

### Claim 2 (depends on 1)

The method of claim 1 in which the number of members within the set is determined by a user.

### Claim 3 (depends on 1)

The method of claim 1 in which the members of the set are determined by set management software implemented on a computer.

### Claim 4 (depends on 1)

The method of claim 1 in which the members of the set are determined by a user.

### Claim 5 (depends on 1)

The method of claim 1 in which the members of the set are selected from a larger set of items sharing at least on characteristic.

### Claim 6 (depends on 1)

The method of claim 1 in which the steps are executed on a local computer.

### Claim 7 (depends on 1)

The method of claim 1 in which at least some of the steps are executed on a remote computer in communication with a local computer.
