Managing Call Centers with Many Strategic Agents

Similar documents
Making Delay Announcements

Stochastic Networks and Parameter Uncertainty

Dynamic Control of Parallel-Server Systems

A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL

The Performance Impact of Delay Announcements

Delay Announcements. Predicting Queueing Delays for Delay Announcements. IEOR 4615, Service Engineering, Professor Whitt. Lecture 21, April 21, 2015

Online Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates

Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement

Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement

Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015

DELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS. Rouba Ibrahim Ward Whitt

Erlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:

We consider how two networked large-scale service systems that normally operate separately, such as call

Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing

Proactive Care with Degrading Class Types

Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity

Proactive customer service: operational benefits and economic frictions

λ λ λ In-class problems

Queueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions

Managing Queueing Systems Where Capacity Is Random. and Customers Are Impatient. Rouba Ibrahim. August 6, 2017

Design heuristic for parallel many server systems under FCFS-ALIS Adan, I.J.B.F.; Boon, M.A.A.; Weiss, G.

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Design and evaluation of overloaded service systems with skill based routing, under FCFS policies

REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY SUPPLEMENTARY MATERIAL

Solutions to COMP9334 Week 8 Sample Problems

ec1 e-companion to Liu and Whitt: Stabilizing Performance

Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1

The shortest queue problem

SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012

REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS

Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers

Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers

6 Solving Queueing Models

arxiv: v1 [math.oc] 10 Jan 2019

Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals

One billion+ terminals in voice network alone

Design, staffing and control of large service systems: The case of a single customer class and multiple server types. April 2, 2004 DRAFT.

COMP9334: Capacity Planning of Computer Systems and Networks

Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma

Non Markovian Queues (contd.)

What You Should Know About Queueing Models To Set Staffing Requirements in Service Systems

CS 798: Homework Assignment 3 (Queueing Theory)

A Fluid Approximation for Service Systems Responding to Unexpected Overloads

Wait-Time Predictors for Customer Service Systems With Time-Varying Demand and Capacity

A Fluid Approximation for Service Systems Responding to Unexpected Overloads

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Dynamic Atomic Congestion Games with Seasonal Flows

Motivated by models of tenant assignment in public housing, we study approximating deterministic fluid

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

BRAVO for QED Queues

Overflow Networks: Approximations and Implications to Call-Center Outsourcing

On the Partitioning of Servers in Queueing Systems during Rush Hour

We study a capacity sizing problem in a service system that is modeled as a single-class queue with multiple

Figure 10.1: Recording when the event E occurs

Session-Based Queueing Systems

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

STRATEGIC EQUILIBRIUM VS. GLOBAL OPTIMUM FOR A PAIR OF COMPETING SERVERS

Link Models for Packet Switching

Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals

STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES

Economy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Nitzan Carmeli. MSc Advisors: Prof. Haya Kaspi, Prof. Avishai Mandelbaum Empirical Support: Dr. Galit Yom-Tov

Advanced Computer Networks Lecture 3. Models of Queuing

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

The Social Value of Credible Public Information

Classical Queueing Models.

Wars of Attrition with Budget Constraints

Lecture 9: Dynamics in Load Balancing

Data analysis and stochastic modeling

16:330:543 Communication Networks I Midterm Exam November 7, 2005

ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16)

Service-Level Differentiation in Many-Server Service Systems Via Queue-Ratio Routing

Allocating Resources, in the Future

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Equilibrium solutions in the observable M/M/1 queue with overtaking

FCFS Infinite Bipartite Matching with Applications

Staffing Call-Centers With Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

A multi-class fluid model for a contact center with skill-based routing

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Computer Systems Modelling

Routing and Staffing when Servers are Strategic

We consider a call center model with m input flows and r pools of agents; the m-vector of instantaneous

Basics of Game Theory

LIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974

Homework 1 - SOLUTION

Random Walk on a Graph

Time-dependent Performance Approximation of Truck Handling Operations at an Air Cargo Terminal

The M/M/n+G Queue: Summary of Performance Measures

NATCOR: Stochastic Modelling

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

Strategic Dynamic Jockeying Between Two Parallel Queues

Transcription:

Managing Call Centers with Many Strategic Agents Rouba Ibrahim, Kenan Arifoglu Management Science and Innovation, UCL YEQT Workshop - Eindhoven November 2014

Work Schedule Flexibility 86SwofwthewqBestwCompanieswtowWorkwForqwofferw employeeswsomewtypewofwflexiblewschedule. -3Fortune,32014. 81Swofwemployerswallowedwsomewworkerswtow periodicallywchangewtheirwstartingwandwquittingwtimes.w -3National3Study3of3Employers3(USA),32013. InwthewUS,wallwfederalwemployeeswnowwhavewthew rightwtowrequestwmorewflexiblewworkwoptions.ww -ywhiteyhouseymemoyissuedyonyjuney23,y2014.y InwthewUK,wthewrightwtowrequestwflexiblewworkingw hourswiswnowwextendedwtowallwworkers.ww -yflexibleyworkingylawyissuedyonyjulyy1,y2014.y

Flexitime at Hydro-Québec Flexitime schedule: 30% of call center agents have flexible work hours Must be there during core periods (2 periods of 2 hours each) Are otherwise free to choose their time schedules Don t need to inform their managers ahead of time Must be there for a total of 70 hours per 2 weeks

Flexitime at Hydro-Québec Flexitime schedule: 30% of call center agents have flexible work hours Must be there during core periods (2 periods of 2 hours each) Are otherwise free to choose their time schedules Don t need to inform their managers ahead of time Must be there for a total of 70 hours per 2 weeks Major headaches for Hydro-Québec s call center managers!

Research Questions What is the impact of strategic agent behavior on the system? What are optimal operational decisions with strategic agents? Can we align the objectives of the system manager and the agents?

Related Literature Staffing and routing in many-server systems Queueing games Strategic servers in queues Gopalakrishnan, R., Dorouli, S., Ward, A. and A. Weirman. 2014. Routing and staffing when servers are strategic. Gurvich, I., Lariviere, M. and A. Moreno-Garcia. 2014. Staffing service systems when capacity has a mind of its own.

Staffing Decisions with Non-Strategic Agents

Non-Strategic Agents Queueing Framework µ...... µ θ θ λ A Period A λ B Period B Poisson arrival processes with rates λ A, λ B No overlap between periods A and B I.I.D. exponential service times with rate µ = 1 I.I.D. exponential abandonment times with rate θ

Non-Strategic Agents System Manager s Problem with Non-Strategic Agents Staffing Costs c: Fixed compensation r: Variable compensation rate t A, t B : Total compensations t A = c + r λa n A and t B = c + r λb n B. Customer-Related Costs p: Abandonment penalty cost ($ per customer who abandons) h: Delay cost ($ per customer per minute wait)

Non-Strategic Agents Fluid Approximation to the System Manager s Problem For t = A, B: n t : Number of servers in period t q t : Queue length in period t η t : Total abandonment rate in period t η t = (λ t n t ) + and q t = η t θ. The system manager determines optimal staffing levels n A and n B : ( min {n A n A 0,n B 0 + c + r λ A n A ( p + h θ ) ( + n B c + r λ B n B ) (λ A n A ) + + ) ( p + h θ ) (λ B n B ) + } Bassamboo and Randhawa (2010).

Non-Strategic Agents Fluid-Based Prescriptions with Non-Strategic Agents Recall: c = staffing cost; p = abandonment cost; h = delay cost. Optimal Staffing Levels (i) if c p + h/θ, then n A = λ A and n B = λ B, (ii) if c > p + h/θ, then n A = n B = 0. In (i), both A and B are critically loaded. In this case, n A α = na + n B = λ A λ A + λ B and ρ A = ρ B = 1, where ρ t = λ t /n t.

Strategic Agents Staffing Decisions with Strategic Agents

Strategic Agents Strategic Agent Behavior µ...... µ θ θ λ A Period A λ B Period B Agents have individual valuations for working in either period Strategic agents select working period of their choice

Strategic Agents A Two-Stage Sequential Game Sequence of events Stage 1: System manager selects total staffing level n Stage 2: Agents in pool of size n select working period An equilibrium arises in the system. We determine this equilibrium by using backward induction.

Strategic Agents Second Stage: Agent s Problem

Strategic Agents Individual Agent Preferences n: Total number of agents in the system (given) n A, n B : To be determined by the agents Independent and heterogeneous agents v A, v B : agent valuations v A (n A ) = c + r λa n A and v B (n B ) = c + (r + X ) λb n B, where X is a random variable (cdf F, ccdf F ). Agent selects period A if, and only if, v A (n A ) v B (n B ).

Strategic Agents Subgame Perfect Nash Equilibrium Let α e be the equilibrium proportion of agents who select A. Existence and Uniqueness of Equilibrium We show that there exists a unique equilibrium threshold, t e, such that α e = P(X t e ) = F (t e ). We also show that t e is the unique solution of: r λ A F (t e ) λ B F (t e ) r te = 0.

Strategic Agents Impact of Strategic Agent Behavior Recall that we have at optimum in the non-strategic case: α = λ A /(λ A + λ B ) is the optimal proportion of agents who are in A ρ A = ρ B = 1 Comparison with the Non-Strategic Case We show that, for any value of n, the following hold: (i) F (0) = α α e = α (ii) F (0) < α α e < α (iii) F (0) > α α e > α where F (0) = P(X 0).

Strategic Agents Explanation: Case (i) Suppose that the staffing levels in periods A and B are as follows: Period A Period B n A = λ A Then, let agents select their periods. n B = λ B The proportion of agents who choose period A is: ( P(v B v A ) = P c + (r + X ) λ B c + r λ ) A = P(X 0) = F (0). n B n A So, for the above to be an equilibrium state, we need to have: F (0) = In this case, α e = F (0) = α. λ A λ A + λ B = α.

Strategic Agents Case (ii): System Imbalance Now, what happens if F (0) < α? Period A Period B n A < λ A n B > λ B The proportion of agents who choose period A is: ( P(v B v A ) = P c + (r + X ) λ B c + r λ ) A = P(X 0) = F (0) < α. n B n A In this case, some agents in A will now select B instead. So, our initial state cannot be an equilibrium, and we have: F (0) < α e < α. In this case, period A becomes overloaded and period B underloaded.

Strategic Agents First Stage: System Manager s Problem

Strategic Agents Fluid Approximation with Strategic Agents In this stage, assume that α e is given. The system manager determines the optimal total staffing level n: ( min {nα e n 0 + c + r λ A nα ( e p + h θ ) ( + n(1 α e ) ) (λ A nα e ) + + ) λ B c + r n(1 α e ) ( p + h ) } (λ B n(1 α e )) + θ

Strategic Agents Fluid-Based Prescriptions: Asymptotically Optimal Regimes It is never optimal to have: Both A and B underloaded Both A and B overloaded So, have at least one period critically loaded. A overloaded B critically loaded A critically loaded B underloaded A underloaded B critically loaded A critically loaded B overloaded 0 c/(p+h/θ) α * 1 c/(p+h/θ) 1 α e

Strategic Agents Cost Impact of Strategic Agents 100 90 80 Percent cost increase 70 60 50 40 30 20 α * 10 0 c = 0.5, p = 0.7, h = 1, and µ = θ = 1 λ A = 150 and λ B = 250 X uniform on (x l, x u ) Vary r, x l, and x u to vary α e α e

System Controls

A Coordinating Compensation Scheme Let r A = r + β A and r B = r + β B be the variable compensation rates for periods A and B. Unequal Compensation Rates We show that the compensation scheme with β A = (1 α )F 1 (α ) and β B = α F 1 (α ), is a budget-neutral compensation scheme for which α e (r A, r B ) = α. The system manager can control the system by increasing compensation in the period which is busier at equilibrium.

Conclusions We proposed a model for strategic agents We quantified the impact of strategic agent behavior We derived optimal staffing levels with strategic agents We developed a compensation scheme that makes agents behave in line with the system manager s objective

Extensions We also considered the following extensions: Social welfare Different agent valuation models Routing Decisions What if the system manager doesn t honor or only partially honors agents choices? General abandonment Heterogeneous service rates

Thank You!