Auction-Based Mechanism for Dynamic and Efficient Resource Allocation
提出一种Vickrey-Clarke-Groves型拍卖机制，通过二维投标和分散动态过程实现无限可分资源的有效分配，并证明激励相容性和纳什均衡的唯一性。
We study how to efficiently allocate the infinitesimal divisible resource under auction mechanism in a dynamic way. We propose a Vickrey-Clarke-Groves-type auction mechanism with a 2-D bid which specifies a per unit price and a maximum of the demand. Due to the absence of enough information related to the infinite dimensional valuations of individual players in a single-bid strategy, it is challenging to implement the efficient Nash equilibrium (NE) in a dynamic way. In this paper, we introduce a pair of parameters related to players' valuations, and design a decentralized dynamic process assisted with this pair of values, such that at each iteration, a single player updates its best bid under a constrained set of demand. Under the proposed auction mechanism, we show the incentive compatibility, efficiency, and uniqueness of the NE. Furthermore, our method is guaranteed to converge to the efficient NE, and it presents the enhanced convergence performance compared with those methods proposed in the literature. Case studies are given to demonstrate the results developed in this paper.