IDEAS home Printed from
   My bibliography  Save this paper

Design, Analysis and Simulation of the Progressive Second Price Auction for Network Bandwidth Sharing


  • Aurel Lazar

    (Columbia University)

  • Nemo Semret

    (Columbia University)


We present the Progressive Second Price auction, a new decentralized mechanism for allocation of variable-size shares of a resource among multiple users. Unlike most mechanisms in the economics litterature, PSP is designed with a very small message space, making it suitable for real-time market pricing of communication bandwidth. Under elastic demand, the PSP auction is incentive compatible and stable, in that it has a ``truthful'' $\epsilon$-Nash equilibrium where all players bid at prices equal to their marginal valuation of the resource. PSP is efficient in that the equilibrium allocation maximizes total user value. The equilibrium holds when PSP is applied by independent resource controllers on each link of a network with arbitrary topology, with users having arbitrary but fixed routes. In the network case, the distributed mechanism has a further incentive compatibility in that submitting the same bid at all links along the route is an optimal strategy for each user, regardless of other players' actions. Using a prototype implementation of the auction game on the Internet, we investigate how convergence times scale with the number of bidders, as well as the trade-off between economic efficiency and signalling load. Finally, we provide a rate-distortion theoretic basis for valuation of bandwidth, which leads naturally to the elastic demand model that is assumed in the analysis of the mechanism.

Suggested Citation

  • Aurel Lazar & Nemo Semret, 1998. "Design, Analysis and Simulation of the Progressive Second Price Auction for Network Bandwidth Sharing," Game Theory and Information 9809001, University Library of Munich, Germany.
  • Handle: RePEc:wpa:wuwpga:9809001
    Note: Type of Document - Postscript (LaTeX); prepared on UNIX Sparc TeX; to print on PostScript; pages: 35 ; figures: included. Appeared in part at 8th ISDG, July 1998.

    Download full text from publisher

    File URL:
    Download Restriction: no

    File URL:
    Download Restriction: no

    More about this item


    resource allocation; auctions; game theory; mechanism design; network pricing;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:9809001. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.