Comments on: Recent developments in the queueing problem Leticia Lorenzo ∗ Published in TOP † The problem of queues and waiting times is part of our daily life and so it is a situation that deserves a thorough study. Queueing theory mathematically studies the waiting lines and is part of the operations research field. This problem involves more complexity since it considers: the arrival process of the agents (customers) according to some probability distribution; the service time distribution and the number of available servers (in line or in parallel); and, finally, the queue discipline that determines the method used to serve the agents: first come, first served; last come, first served; etc. Chun presents a nice survey about the recent results on queueing problems where: there is only one server; the service time is the same for all agents (normalized to one); agents arrive according to some stochastic process; congestion may occur, and so the agents incur in waiting costs. The objective in this model, introduced by Dolan (1978), is to find an allocation rule that fixes the order in which the agents should be served and the monetary transfers. This problem can be addressed from several different approaches. We can assume an administrator is in charge of determining the order of the agents and the monetary transfers. But to do so, the administrator needs to know the waiting cost of each of the agents. We can assume that this is public information or we can assume it is private information and so an agent might reveal a different waiting cost if that is profitable for her. In the latter, it is important to provide incentives for the agents to reveal their true waiting costs. A queueing problem for a group of agents N is a vector θ =(θ i ) i∈N , where θ i stands for the waiting cost of agent i. A solution, or a rule, for this problem is a pair (σ, t), where for each i, σ i denotes the position in the queue and t i denotes her monetary transfer. It is clear that to minimize the aggregated waiting cost, agents should be served according to their waiting cost in non-increasing order (queue efficiency). The property of queue efficiency means that the queue method applied in this problem is a priority queueing discipline that assigns a priority level, the waiting cost θ i in this case, to each customer and they are served following such priority on the first come first served basis. * Economics, Society and Territory (ECOSOT) and Departamento de Estat´ ıstica e IO. Universidade de Vigo. 36200 Vigo (Pontevedra), Spain. Email: leticialorenzo@uvigo.es. Financial support by research grants ECO2014-52616-R and ECO2017-82241-16 R from the Spanish Ministry of Science and Competitiveness, and GRC 2015/014 from Xunta de Galicia is gratefully acknowledged. † DOI: 10.1007/s11750-019-00500-w. Creative Commons Attribution Non-comercial No Derivatives License 1