Congestion allocation for distributed networks: An experimental study

Yan Chen; Laura Razzolini; Theodore L. Turocy

doi:10.1007/s00199-007-0213-z

Congestion allocation for distributed networks: An experimental study

Yan Chen, Laura Razzolini, Theodore L. Turocy

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

This paper reports an experimental study of two prominent congestion and cost allocation mechanisms for distributed networks. We study the fair queuing (or serial) and the FIFO (or average cost pricing) mechanisms under two different treatments: a complete information treatment and a limited information treatment designed to simulate distributed networks. Experimental results show that the fair queuing mechanism performs significantly better than FIFO in all treatments in terms of efficiency, predictability measured as frequency of equilibrium play, and the speed of convergence to equilibrium.

Original language	English
Pages (from-to)	121-143
Number of pages	23
Journal	Economic Theory
Volume	33
Issue number	1
DOIs	https://doi.org/10.1007/s00199-007-0213-z
Publication status	Published - 2007

Access to Document

10.1007/s00199-007-0213-z

Cite this

@article{edb30633da4b493d8a71ddc240c159bb,

title = "Congestion allocation for distributed networks: An experimental study",

abstract = "This paper reports an experimental study of two prominent congestion and cost allocation mechanisms for distributed networks. We study the fair queuing (or serial) and the FIFO (or average cost pricing) mechanisms under two different treatments: a complete information treatment and a limited information treatment designed to simulate distributed networks. Experimental results show that the fair queuing mechanism performs significantly better than FIFO in all treatments in terms of efficiency, predictability measured as frequency of equilibrium play, and the speed of convergence to equilibrium.",

author = "Yan Chen and Laura Razzolini and Turocy, {Theodore L.}",

year = "2007",

doi = "10.1007/s00199-007-0213-z",

language = "English",

volume = "33",

pages = "121--143",

journal = "Economic Theory",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Congestion allocation for distributed networks: An experimental study

AU - Chen, Yan

AU - Razzolini, Laura

AU - Turocy, Theodore L.

PY - 2007

Y1 - 2007

N2 - This paper reports an experimental study of two prominent congestion and cost allocation mechanisms for distributed networks. We study the fair queuing (or serial) and the FIFO (or average cost pricing) mechanisms under two different treatments: a complete information treatment and a limited information treatment designed to simulate distributed networks. Experimental results show that the fair queuing mechanism performs significantly better than FIFO in all treatments in terms of efficiency, predictability measured as frequency of equilibrium play, and the speed of convergence to equilibrium.

AB - This paper reports an experimental study of two prominent congestion and cost allocation mechanisms for distributed networks. We study the fair queuing (or serial) and the FIFO (or average cost pricing) mechanisms under two different treatments: a complete information treatment and a limited information treatment designed to simulate distributed networks. Experimental results show that the fair queuing mechanism performs significantly better than FIFO in all treatments in terms of efficiency, predictability measured as frequency of equilibrium play, and the speed of convergence to equilibrium.

U2 - 10.1007/s00199-007-0213-z

DO - 10.1007/s00199-007-0213-z

M3 - Article

VL - 33

SP - 121

EP - 143

JO - Economic Theory

JF - Economic Theory

IS - 1

ER -