EQUILIBRIUM STRATEGIES FOR PROCESSOR SHARING AND RANDOM QUEUES WITH RELATIVE PRIORITIES

We consider a memoryless single-server queue in which users can purcha se relative priority so as to reduce their expected waiting costs, whi ch are linear with time. Relative priority is given in proportion to a price paid by customers present in the system. For two service discip lines, (weighted) processor sharing and (weighted) random entrance, we find the unique pure and symmetric Nash equilibrium price paid by the customers.