This chapter studies a class of auction-based resource allocation games under a hierarchical structure, such that each supplier is assigned a certain amount of resource from a single provider and allocates it to its buyers with auction mechanisms. To implement the efficient allocations for the underlying hierarchical system, we first design an auction mechanism, for each local system composed of a supplier and its buyers, which inherits the advantages of the progressive second price (PSP) mechanism. By employing a dynamic algorithm, each local system converges to its own efficient Nash equilibrium (NE), at which the efficient resource allocation is achieved and the bidding prices of all the buyers in this local system are identical to each other. After the local systems reach their own equilibria, respectively, the resources assigned to suppliers are readjusted via a dynamic hierarchical algorithm with respect to the bidding prices associated with the implemented equilibria of local systems. By applying the proposed hierarchical process, the formulated hierarchical system can converge to the efficient allocation under certain mild conditions. The developed results in this work are demonstrated with simulations.
Hierarchical Auction Games for Efficient Resource Allocation
Efficient Auction Games ; Chapter : 4 ; 93-116
2020-02-14
24 pages
Article/Chapter (Book)
Electronic Resource
English
Double-Sided Auction Games for Efficient Resource Allocation
Springer Verlag | 2020
|Auction Mechanisms for Efficient Single-Type Divisible Resource Allocation
Springer Verlag | 2020
|Efficient Charging Coordination for Electric Vehicles Under Auction Games
Springer Verlag | 2020
|Resource Allocation Based on Auction Game of Satellite Avionics System
Springer Verlag | 2019
|