Year-end Sale % OFF 
Abstract
We study a class of queueing problems with endogenous arrival times formulated as non-cooperative n-person games in normal form. With multiple equilibria in pure strategies, these queueing games give rise to problems of tacit coordination. We first describe a Markov chain algorithm used to compute the symmetric mixed-strategy equilibrium solution, and then report the results of an experimental study of a large-scale ( n=20) queueing game with fixed service time, FIFO queue discipline, and no early arrivals. Our results show consistent and replicable patterns of arrival that provide strong support for mixed-strategy equilibrium play on the aggregate but not individual level.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
