HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Pricing the Internet with Multi-Bid Auctions

Patrick Maillé 1 Bruno Tuffin 1
1 ARMOR - Architectures and network models
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, Ecole Nationale Supérieure des Télécommunications de Bretagne
Abstract : Usage-based or congestion-based charging schemes have been regarded as a relevant way to control congestion and to differentiate services among users in telecommunication networks; auctioning for bandwidth appears as one of several possibilities. In a previous work, the authors designed a multi-bid auction scheme where users compete for bandwidth at a link by submitting several couples (amount of bandwidth asked, associated unit price) so that the link allocates the bandwidth and computes the charge according to the second price principle. They showed that incentive compatibility and efficiency among other properties are verified. We propose in the present paper to extend this scheme to the case of a network, by using the properties/assumptions that the backbone network is overprovisionned and the access networks have a tree structure.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:33:58 PM
Last modification on : Friday, February 4, 2022 - 3:25:00 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:52:03 PM


  • HAL Id : inria-00070763, version 1


Patrick Maillé, Bruno Tuffin. Pricing the Internet with Multi-Bid Auctions. [Research Report] RR-5235, INRIA. 2004, pp.31. ⟨inria-00070763⟩



Record views


Files downloads