Nash bargaining on a processor sharing queue

Abstract

This paper presents an approach through the bargaining game theory on the capacity sharing in a queue with processor sharing discipline. It has a brief review of such a type of queue and the Nash bargaining solution. It demonstrates the feasibility of insensitive and balanced sharing. It also proves that sharing is not insensitive and balanced if the notion of priority is integrated in the queue.