Queue-length Variations In A Two-Restaurant Problem

Details Queue-length Variations In A Two-Restaurant Problem Queue-length Variations In A Two-Restaurant Problem

2008-08-23

arxiv.org/abs/0808.3196v1

Computer Science

Computer Science and Game Theory

7 pages, 6 figures

Scientific paper

This paper attempts to find out numerically the distribution of the queue-length ratio in the context of a model of preferential attachment. Here we consider two restaurants only and a large number of customers (agents) who come to these restaurants. Each day the same number of agents sequentially arrives and decides which restaurant to enter. If all the agents literally follow the crowd then there is no difference between this model and the famous `P\'olya's Urn' model. But as agents alter their strategies different kind of dynamics of the model is seen. It is seen from numerical results that the existence of a distribution of the fixed points is quite robust and it is also seen that in some cases the variations in the ratio of the queue-lengths follow a power-law.

Affiliated with

Also associated with

No associations

Rating

Queue-length Variations In A Two-Restaurant Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Queue-length Variations In A Two-Restaurant Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Queue-length Variations In A Two-Restaurant Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129143