Congestion allocation for distributed networks: An experimental study

Yan Chen, Laura Razzolini, Theodore L. Turocy

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


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 languageEnglish
Pages (from-to)121-143
Number of pages23
JournalEconomic Theory
Issue number1
Publication statusPublished - 2007

Cite this