Chen, Yan, Razzolini, Laura and Turocy, Theodore L. ORCID: https://orcid.org/0000-0002-2265-844X (2007) Congestion allocation for distributed networks: An experimental study. Economic Theory, 33 (1). pp. 121-143.
Full text not available from this repository. (Request a copy)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.
Item Type: | Article |
---|---|
Faculty \ School: | Faculty of Social Sciences > School of Economics |
UEA Research Groups: | Faculty of Social Sciences > Research Groups > Experimental Economics (former - to 2017) Faculty of Social Sciences > Research Groups > Environment, Resources and Conflict Faculty of Social Sciences > Research Groups > Economic Theory Faculty of Social Sciences > Research Centres > Centre for Behavioural and Experimental Social Sciences Faculty of Social Sciences > Research Centres > Centre for Competition Policy Faculty of Social Sciences > Research Groups > Behavioural Economics |
Depositing User: | Gina Neff |
Date Deposited: | 17 Jan 2011 11:19 |
Last Modified: | 15 Aug 2023 12:30 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/19300 |
DOI: | 10.1007/s00199-007-0213-z |
Actions (login required)
View Item |