Ergodic risk-sensitive admission control problem for a Markovian multi-server queueing system with abandonment
Nicola Sassone & Guodong Pang
What the paper says
We consider the ergodic risk-sensitive admission control problem for a Markovian multi-server queueing system with abandonment, where costs are incurred for server idleness, customer abandonment, and rejecting incoming arrivals. We first derive the Bellman optimality equation for this problem and show that a threshold policy—one that rejects incoming arrivals whenever the system-size exceeds a threshold—is optimal among all admissible control policies. We then propose a policy iteration algorithm to identify the optimal threshold, where we prove, under certain conditions on the problem’s parameters, that the algorithm will terminate at the optimal threshold level. We also characterize the effect of risk sensitivity on the optimal threshold, proving that this threshold monotonically decreases with respect to the sensitivity parameter and converges to the average cost optimal threshold from below as the sensitivity parameter tends to zero.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.