Social and monopoly optimization in observable queues
Year of publication: |
2020
|
---|---|
Authors: | Hassin, Refael ; Snitkovsky, Ran I. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 4, p. 1178-1198
|
Subject: | observable queues | Naor's inequality | optimal admission | Warteschlangentheorie | Queueing theory | Monopol | Monopoly | Mathematische Optimierung | Mathematical programming |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | Enthält Corrigendum zu selbigem Aufsatz |
Other identifiers: | 10.1287/opre.2019.1907 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Profit maximization in the M/M/1 queue
Hassin, Refael, (2017)
-
Sequential bidding for merging in algorithmic traffic
Markakis, Mihalis G., (2023)
-
Pooled vs. dedicated queues when customers are delay-sensitive
Sunar, Nur, (2021)
- More ...
-
Tipping in service systems : the role of a social norm
Debo, Laurens G., (2018)
-
Stochastic approximation of symmetric Nash equilibria in queueing games
Ravner, Liron, (2024)
-
On Shortest Paths in Graphs with Random Weights
Hassin, Refael, (1984)
- More ...