On the rapid convergence of a class of decentralized decision processes: quantized progressive second-price auctions

A progressive second price (PSP) auction mechanism was proposed in (Semret, Liao, Campbell & Lazar 2000) for network bandwidth allocation. In this paper a quantized version of this mechanism (Q-PSP) is analyzed where the agents have similar demand functions and submit bids synchronously. It is shown that the non-linear dynamics induced by this mechanism are such that the prices bid by the various agents and the quantities allocated to these agents converge in at most five iterations or oscillate indefinitely; this behaviour is not only independent of the number of agents involved but is also independent of the number of quantization levels.

[1]  Joseph M. Ostroy,et al.  Vickrey-Clarke-Groves mechanisms and perfect competition , 1987 .

[2]  Josef Hofbauer,et al.  Evolutionary Games and Population Dynamics , 1998 .

[3]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[4]  D. Fudenberg,et al.  The Theory of Learning in Games , 1998 .

[5]  Aurel A. Lazar,et al.  Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing , 1999 .

[6]  Aurel A. Lazar,et al.  Market mechanisms for network resource sharing , 1999 .

[7]  Andrew T. Campbell,et al.  Pricing, provisioning and peering: dynamic markets for differentiated Internet services and implications for network interconnections , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Vol Cxv Issue.  EFFICIENT AUCTIONS , 2000 .

[9]  Sven de Vries,et al.  Linear Programming and Vickrey Auctions , 2001 .

[10]  Bruno Tuffin.  Revisited Progressive Second Price Auction for Charging Telecommunication Networks , 2002, Telecommun. Syst..

[11]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[12]  Wai Sum Lai,et al.  Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering , 2003, RFC.

[13]  Patrick Maillé,et al.  Multibid auctions for bandwidth allocation in communication networks , 2004, IEEE INFOCOM 2004.

[14]  Patrick Maillé,et al.  Multi-bid Versus Progressive Second Price Auctions in a Stochastic Environment , 2004, QofIS.

[15]  E. Bretagne.  Multi-Bid Auctions for Bandwidth Allocation in Communication Networks , 2005 .

[16]  Pravin Varaiya,et al.  The Combinatorial Seller ’ s Bid Double Auction : An Asymptotically Efficient Market Mechanism * , 2006 .

[17]  Rahul Jain,et al.  Designing a strategic bipartite matching market , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  Krzysztof Malinowski,et al.  On Efficient Resource Allocation in Communication Networks , 2007, SOFSEM.

[19]  Krzysztof Malinowski,et al.  Characterization of scalar strategy mechanisms for efficient resource allocation: Supply side case , 2007, 2007 46th IEEE Conference on Decision and Control.

[20]  Peter E. Caines,et al.  Analysis of a class of decentralized decision processes: Quantized progressive second price auctions , 2007, 2007 46th IEEE Conference on Decision and Control.