Carregant...
Fitxers
Tipus de document
ArticleVersió
Versió acceptadaData de publicació
Llicència de publicació
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/207066
Queueing games with an endogenous number of machines
Títol de la revista
Autors
Director/Tutor
ISSN de la revista
Títol del volum
Recurs relacionat
Resum
We study queueing problems with an endogenous number of machines, the novelty being that coalitions not only choose how to queue, but on how many machines. After minimizing the processing costs and machine costs, we share the proceeds of this cooperation, and study the existence of stable allocations. First, we study queueing problems, and examine how to share the total cost. We provide an upper bound and a lower bound on the cost of a machine to guarantee the non-emptiness of the core. Next, we study requeueing problems, where there is an existing queue. We examine how to share the cost savings compared to the initial situation, when optimally requeueing/changing the number of machines. Although stable allocations may not exist, we guarantee their existence when all machines are considered public goods, and we start with an initial queue in which agents with larger waiting costs are processed first
Matèries (anglès)
Citació
Citació
ATAY, Ata, TRUDEAU, Christian. Queueing games with an endogenous number of machines. _Games and Economic Behavior_. 2024. Vol. 144, núm. 104-125. [consulta: 24 de gener de 2026]. ISSN: 0899-8256. [Disponible a: https://hdl.handle.net/2445/207066]