# US 2012/0084173 A1 · Method, computer program product and system for dynamically pricing peerishable goods

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

- Number: US 2012/0084173 A1
- Document ID: US20120084173A1
- Status: Published application
- Kind: A1
- Application number: 13/246,062
- Filed: 2011-09-27
- Published: 2012-04-05
- Earliest claimed: 2010-09-27
- Inventors: Anders Goran Ekholm
- Web page: https://patentgrep.com/patent/US20120084173A1

## CPC

- G06Q 30/0601: Electronic shopping [e-shopping]
- G06Q 30/0206: {Price or cost determination based on market factors}
- G06Q 30/0283: Price estimation or determination
- G06Q 30/08: Auctions
- 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

Method for dynamically pricing perishable goods with objective of selling all items before point in time any remaining items become worthless, the method comprising: a) controlling time-to-live parameter (TTL) corresponding to maximum time period (t=tn) an item is good for sale, and if time-to-live parameter (TTL)≦tn, then; b) counting down update frequency time period until price is updated; c) if interest to buy the goods is received, offering temporarily fixed price Pfreeze equal to current price for a limited period; d) automatically updating current price according to expressed interest; e) accepting order at temporarily fixed price if order is received within limited time period; f) rejecting the order if order is received after limited time period; g) automatically updating current price in accordance with time of receiving accepted order or elapsing of update frequency time period, and automatically repeating the steps b)-g) until time period equals time-to-live parameter.

## Claims

### Claim 1

A method for dynamically pricing perishable goods in a goods order system, the method comprising the steps of:
a) controlling a time-to-live parameter (TTL) corresponding to a maximum time period (t=tn) an item of goods is good for sale, and if time-to-live parameter (TTL)≦tn, then,
b) counting down an update frequency time period (ΔTupdate) until the price is updated;
c) if interest to buy the goods (asking for a “quote”) is received, offering a temporarily fixed price Pfreeze equal to current price (Pcurrent) for a limited time period (Δtfreeze);
d) automatically updating the current price (Pcurrent) according to the expressed interest to buy the goods;
e) accepting order at temporarily fixed price Pfreeze if order (“buy”) is received within strictly limited time period Δtfreeze;
f) rejecting the order if order is received after limited time period Δtfreeze;
g) automatically updating the current price (Pcurrent) of the item of goods in accordance with time of receiving accepted order, or elapsing of update frequency time period (ΔTupdate); and
automatically repeating the steps b)-g) until the time period (t=tn) equals the time-to-live (TTL) parameter.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising the step of:
setting initial settings, including initial price P(0), the time-to-live parameter (TTL) and update frequency time period (ΔTupdate);
beginning sale of goods having a current price (Pcurrent) at a first time (t=t0).

### Claim 3 (depends on 1)

The method according to claim 1, further comprising the steps of:
offering a temporarily fixed price Pfreeze equal to current price (Pcurrent) for a limited time period (Δtfreeze) and updating the current price (Pcurrent) accordingly, and
accepting order if time (t) is less than or equal to a strictly limited frozen price time Δtfreeze and updating the current price (Pcurrent) accordingly.

### Claim 4 (depends on 2)

The method according to claim 2, wherein the initial price P(0) is set to the highest price that will sell the maximum volume of the perishable goods MAX(V) at time t=tn.

### Claim 5 (depends on 2)

The method according to claim 2, wherein a minimum price MIN(P) is set.

### Claim 6 (depends on 3)

The method according to claim 3, further comprising the step of:
inserting time t=t1 into an average volume function AV(t) to estimate how many items of goods should have been sold in order for exactly the maximum volume MAX(V) to be sold at time t=tn, based an volume V(1) that has been sold to price P(1).

### Claim 7 (depends on 6)

The method according to claim 6, wherein
in case of no new sale, after a predetermined time interval (Tint), inserting time T=2 into the average volume function AV(T) to estimate how many items of goods should have been sold in order for exactly the maximum volume MAX(V) to be sold at time T=N, based an volume V(2) that has been sold to price P(2).

### Claim 8

A computer program product comprising computer-readable medium comprising code for causing a computer to:
control a time-to-live parameter (TTL) corresponding to a maximum time period (t=tn) an item of goods is good for sale, and if time-to-live parameter (TTL)≦tn, then;
count down an update frequency time period (ΔTupdate) until the price is updated;
offer fixed price for a limited time period (Δtfreeze).
update current price (Pcurrent) to reflect the offered fixed price;
accept order if order to buy the goods is received before end of the limited time period (Δtfreeze),
automatically update the current price (Pcurrent) of the item of goods in accordance with time of receiving order or update frequency time period (ΔTupdate), and
automatically repeat the steps above until the time period (t=tn) equals the time-to-live (TTL) parameter.

### Claim 9

A system for dynamically pricing perishable goods in a goods order system comprising a network of interconnected nodes operatively linked, wherein the governing node comprises at least one database, a computing device and data storage, wherein the database comprises a readable and writeable register, or data memory, wherein information related to registered items of goods, in particular perishable items of goods of goods, are stored, wherein the database is arranged to store the registered items of goods for sale offered on the virtual market place and updated information relative to the contents, wherein the governing node is arranged to cause a computer to:
control a time-to-live parameter (TTL) corresponding to a maximum time period (t=tn) an item of goods is good for sale, and if time-to-live parameter (TTL)≦tn, then;
count down an update frequency time period (ΔTupdate) until the price is updated,
offer a fixed price for a strictly limited time period (Δtfreeze);
update current price (Pcurrent) to reflect the offered fixed price;
accept order if order to buy the goods is received before end of strictly limited time period (Δtfreeze),
automatically update the current price (Pcurrent) of the item of goods in accordance with time of receiving order or update frequency time period (ΔTupdate), and
automatically repeat the steps above until the time period (t=tn) equals the time-to-live (TTL) parameter.
