|
Theodore L. Turocy,
Behavioural game theorist
Director, Centre for Behavioural and Experimental Social Science, University of East Anglia Senior Lecturer, School of Economics, University of East Anglia Director, The Gambit Project |
Congestion allocation for distributed networks: An experimental study
- Citation:
- Chen, Y., Razzolini, L., Turocy, T.L. (2007) Congestion allocation for distributed networks: An experimental study. Economic Theory 33(1): 121-143. DOI: 10.1007/s00199-007-0213-z
- 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.
- Keywords:
- Serial cost sharing; congestion allocation; experiment
- Availability:
- http://dx.doi.org/10.1007/s00199-007-0213-z