Rejoinder on: recent developments in the queueing problem
We are grateful to Leticia Lorenzo, René van den Brink, and Duygu Yengin for their valuable comments on our survey paper. Below we briefly answer some of their comments and suggestions raised in the discussion.
Lorenzo proposes three interesting generalizations of the queueing problem. First, she asks what happens if the waiting cost is not linear but a function depending on the position of the agents in the queue. This is an interesting question but the answer is not obvious. First, the algorithm for determining the efficient queue is not clear. Indeed, it is not clear whether a general algorithm, applicable to all cost functions, is even available. Further analysis, whether in the axiomatic or strategic mould, is, therefore, likely to be more complex. We regard this question as material for future research and well beyond the scope of this survey.
Second, she agrees with us that it will be an interesting generalization to consider the queueing problem with multiple severs, but makes...
- Thomson W (2013) The theory of fair allocation. University of Rochester, Rochester (book manuscript)Google Scholar