# US 2003/0225679 A1 · Determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase

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

- Number: US 2003/0225679 A1
- Document ID: US20030225679A1
- Status: Published application
- Kind: A1
- Application number: 10/430,472
- Filed: 2003-05-06
- Published: 2003-12-04
- Earliest claimed: 2002-05-16
- Assignees: i2 Technologies US, Inc.
- Inventors: Manoel Tenorio
- Web page: https://patentgrep.com/patent/US20030225679A1

## CPC

- G06Q 30/06: Buying, selling or leasing transactions
- G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
- 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

In one embodiment of the present invention, a method for determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase includes generating a first set of distributions of the group purchase and, for each distribution in the first set, calculating a resulting overall price of the group purchase. One or more distributions are selected from the first set according to the resulting overall prices calculated for the distributions in the first set. One or more subsequent sets of distributions of the group purchase are generated, each subsequent set being generated from one or more solutions selected from an immediately preceding set of solutions according to resulting overall prices calculated for distributions in the immediately preceding set of solutions, the first subsequent set of distributions being generated from the distributions selected from the first set. A distribution resulting in a lowest overall price is selected from a final set of distributions, the distribution selected from the final set of distributions substantially minimizing the overall price of the group purchase.

## Claims

### Claim 1

A system for determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase, the system comprising one or more components collectively operable to:
generate a first set of distributions of the group purchase;
for each distribution in the first set, calculate a resulting overall price of the group purchase;
according to the resulting overall prices calculated for the distributions in the first set, select one or more distributions from the first set;
generate one or more subsequent sets of distributions of the group purchase, each subsequent set being generated from one or more solutions selected from an immediately preceding set of solutions according to resulting overall prices calculated for distributions in the immediately preceding set of solutions, the first subsequent set of distributions being generated from the distributions selected from the first set; and
from a final set of distributions, select a distribution resulting in a lowest overall price, the distribution selected from the final set of distributions substantially minimizing the overall price of the group purchase.

### Claim 2 (depends on 1)

The system of claim 1, wherein a distribution is represented by a string of bits that comprises a plurality of elements, each element corresponding to an item from a seller and comprising one or more bits, a value of an element representing a quantity of a corresponding item from a corresponding seller.

### Claim 3 (depends on 2)

The system of claim 2, wherein the distributions in the first set are generated by assigning to each element of each distribution in the first set an arbitrary value from a substantially uniform distribution of possible values.

### Claim 4 (depends on 1)

The system of claim 1, wherein sets of distributions are generated according to genetic algorithms and a subsequent set of distributions is generated from an immediately preceding set of distributions using one or both of a crossover technique and an asexual reproduction technique.

### Claim 5 (depends on 1)

The system of claim 1, wherein the subsequent sets are generated until a resulting overall price has remained substantially constant over a specified number of generations.

### Claim 6 (depends on 5)

The system of claim 5, wherein the resulting overall price comprises an average resulting overall price.

### Claim 7 (depends on 1)

The system of claim 1, wherein the subsequent sets are generated until an acceptable distribution of the group purchase has been generated.

### Claim 8 (depends on 1)

The system of claim 1, wherein the subsequent sets are generated until a specified number of sets have been generated.

### Claim 9 (depends on 1)

The system of claim 1, wherein the final set of distributions comprises all generated sets of distributions.

### Claim 10 (depends on 1)

The system of claim 1, wherein the final set of distributions comprises a last generated set of distributions.

### Claim 11 (depends on 1)

The system of claim 1, wherein there are one or more restrictions on the group purchase, a distribution that violates the one or more restrictions being barred from selection.

### Claim 12 (depends on 1)

The system of claim 1, wherein the one or more components are software components executable by a computer system associated with a buying group making the group purchase.

### Claim 13 (depends on 1)

The system of claim 1, wherein one or more prices of one or more items from one or more sellers are noncausal such that the prices of the items depend on one or more parameters of the group purchase.

### Claim 14 (depends on 1)

The system of claim 1, wherein the group purchase is made according to the distribution selected from the final set of distributions.

### Claim 15

A method for determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase, the method comprising:
generating a first set of distributions of the group purchase;
for each distribution in the first set, calculating a resulting overall price of the group purchase;
according to the resulting overall prices calculated for the distributions in the first set, selecting one or more distributions from the first set;
generating one or more subsequent sets of distributions of the group purchase, each subsequent set being generated from one or more solutions selected from an immediately preceding set of solutions according to resulting overall prices calculated for distributions in the immediately preceding set of solutions, the first subsequent set of distributions being generated from the distributions selected from the first set; and
from a final set of distributions, selecting a distribution resulting in a lowest overall price, the distribution selected from the final set of distributions substantially minimizing the overall price of the group purchase.

### Claim 16 (depends on 15)

The method of claim 15, wherein a distribution is represented by a string of bits that comprises a plurality of elements, each element corresponding to an item from a seller and comprising one or more bits, a value of an element representing a quantity of a corresponding item from a corresponding seller.

### Claim 17 (depends on 15)

The method of claim 15, wherein the distributions in the first set are generated by assigning to each element of each distribution in the first set an arbitrary value from a substantially uniform distribution of possible values.

### Claim 18 (depends on 15)

The method of claim 15, wherein sets of distributions are generated according to genetic algorithms and a subsequent set of distributions is generated from an immediately preceding set of distributions using one or both of a crossover technique and an asexual reproduction technique.

### Claim 19 (depends on 15)

The method of claim 15, wherein the subsequent sets are generated until a resulting overall price has remained substantially constant over a specified number of generations.

### Claim 20 (depends on 19)

The method of claim 19, wherein the resulting overall price comprises an average resulting overall price.

### Claim 21 (depends on 15)

The method of claim 15, wherein the subsequent sets are generated until an acceptable distribution of the group purchase has been generated.

### Claim 22 (depends on 15)

The method of claim 15, wherein the subsequent sets are generated until a specified number of sets have been generated.

### Claim at position 23 (depends on 15)

23 The method of claim 15, wherein the final set of distributions comprises all generated sets of distributions.

### Claim 24 (depends on 15)

The method of claim 15, wherein the final set of distributions comprises a last generated set of distributions.

### Claim 25 (depends on 15)

The method of claim 15, wherein there are one or more restrictions on the group purchase, a distribution that violates the one or more restrictions being barred from selection.

### Claim 26 (depends on 15)

The method of claim 15, wherein one or more prices of one or more items from one or more sellers are noncausal such that the prices of the items depend on one or more parameters of the group purchase.

### Claim 27 (depends on 15)

The method of claim 15, further comprising making the group purchase according to the distribution selected from the final set of distributions.

### Claim 28

A system for determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase, the system comprising one or more software components executable by a computer system associated with a buying group making the group purchase, the software components collectively operable to:
generate, according to a genetic algorithm, a first set of distributions of the group purchase, a distribution being represented by a string of bits that comprises a plurality of elements, each element corresponding to an item from a seller and comprising one or more bits, a value of an element representing a quantity of a corresponding item from a corresponding seller, the distributions in the first set being generated by assigning to each element of each distribution in the first set an arbitrary value from a substantially uniform distribution of possible values;
for each distribution in the first set, calculate a resulting overall price of the group purchase;
according to the resulting overall prices calculated for the distributions in the first set, select one or more distributions from the first set;
until an acceptable distribution of the group purchase has been generated, generate one or more subsequent sets of distributions of the group purchase according to the genetic algorithm, each subsequent set being generated from one or more solutions selected from an immediately preceding set of solutions according to resulting overall prices calculated for distributions in the immediately preceding set of solutions, the first subsequent set of distributions being generated from the distributions selected from the first set; and
from a final set of distributions, select a distribution resulting in a lowest overall price, the distribution selected from the final set of distributions substantially minimizing the overall price of the group purchase.

### Claim 29

A method for determining a distribution of a group purchase among a number of sellers that substantially minimizes an overall price of the group purchase, the system comprising one or more software components executable by a computer system associated with a buying group making the group purchase, the method comprising:
generating, according to a genetic algorithm, a first set of distributions of the group purchase, a distribution being represented by a string of bits that comprises a plurality of elements, each element corresponding to an item from a seller and comprising one or more bits, a value of an element representing a quantity of a corresponding item from a corresponding seller, the distributions in the first set being generated by assigning to each element of each distribution in the first set an arbitrary value from a substantially uniform distribution of possible values;
for each distribution in the first set, calculating a resulting overall price of the group purchase;
according to the resulting overall prices calculated for the distributions in the first set, selecting one or more distributions from the first set;
until an acceptable distribution of the group purchase has been generated, generating one or more subsequent sets of distributions of the group purchase according to the genetic algorithm, each subsequent set being generated from one or more solutions selected from an immediately preceding set of solutions according to resulting overall prices calculated for distributions in the immediately preceding set of solutions, the first subsequent set of distributions being generated from the distributions selected from the first set; and
from a final set of distributions, selecting a distribution resulting in a lowest overall price, the distribution selected from the final set of distributions substantially minimizing the overall price of the group purchase.
