University of Cambridge > > Isaac Newton Institute Seminar Series > Routing and Staffing to Incentivize Servers in Many-Server Systems

Routing and Staffing to Incentivize Servers in Many-Server Systems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

Co-authors: S. Doroudi, R. Gopalakrishnan, and A. Wierman

Traditionally, research focusing on the design of scheduling and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are often staffed by people. Then, the rate a server chooses to work may be impacted by the scheduling and staffing policies used by the system. We present a model for such ``strategic servers’’ that choose their service rate in order to maximize a trade-off between an ``effort cost’’, which captures the idea that servers exert more effort when working at a faster rate, and a ``value of idleness’’, which assumes that servers prefer to be idle as much as possible. In this strategic server framework, we re-visit classic scheduling and staffing questions in many-server systems, and, in particular, we investigate the performance of the common square-root safety staffing rule.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity