Method and system for real-time allocation of a resource among several entities
View Patent ↗A technique for the allocation and pricing of a resource among n buying agents during an auction bid. A bid sent by each buying agent in the form of a resource demand function s i (p) is received, and a datum corresponding to the equilibrium price p* is calculated from the sum S of the n demand functions s i( p), by means of the relation: S(p*)=Q. All of the bids received during a predetermined period corresponding to a round of bidding are processed in order to determine the quantity of a resource to be allocated to each buying agent. This is followed by the calculation of the data corresponding to the quantity a i to be allocated for this equilibrium price p* to each buying agent i based on its demand function s i such that a i =s i( p*). The management system utilizes the calculated data to allocate the corresponding quantities of the resource, and this data is stored in order to calculate the price to be billed to each buying agent.
1. A system for allocating resources, comprising:
a network server communicatively coupled to a network; and
a buying agent communicatively coupled to the network, wherein the buying agent comprises:
a processor; and
data storage comprising data and programming instructions for:
transmitting one bid to the network server in the form of a resource demand function, wherein the resource demand function is a positive, decreasing function that expresses the buying agent's demand for an allocable resource at a variable price; and
receiving from the network server an allocated quantity of the allocable resource as calculated by the server and a charged price for the buying agent as calculated by the server, wherein the allocated quantity is the resource demand function of an equilibrium price, wherein the charged price is less than or equal to the equilibrium price, and wherein the server calculates the charged price, C i , for a buying agent i according to the equation:
C
i
=
∑
j
≠
i
∫
a
j
s
a
j
0
s
j
-
1
(
p
)
ⅆ
p
wherein a s j expresses the quantity allocated to buying agent j in the presence of buying agent i and a 0 j expresses the quantity that would have been allocated to buying agent j had buying agent i been absent and s j −1 represents the inverse of the resource demand function of buying agent j.
2. The system of claim 1 , wherein the resource demand function is characterized by two selectable parameters, a maximum quantity desired by the buying agent and a coefficient indicating the buying agent's predisposition to pay.
3. The system of claim 1 , further comprising a link communicatively coupled to the network and having divisible bandwidth, wherein the allocable resource comprises the bandwidth of the link.
4. The system of claim 3 , wherein receiving from the network server an allocated quantity of the allocable resource comprises consuming no more than the allocated quantity of bandwidth.
5. The system of claim 1 , wherein the data storage further comprises data and programming instructions for receiving a bill for the charged price.
6. The system of claim 1 wherein the data storage further comprises data and programming instructions for receiving an updated allocated quantity of the allocable resource and an updated charged price without the transmission of an updated bid.