1 paper
Jake Clarkson, Konstantin Avrachenkov, Eitan Altman
Consider an M/M/1-type queue where joining attains a known reward, but a known waiting cost is paid per time unit spent queueing. In the 1960s, Naor showed that any arrival optimal…