### 2016开年讲座信息

2016年1月12日（星期二）下午3:30

信息管理与工程学院102报告厅

（武东路100号上海财经大学）Dynamic Matching in a Two-Sided Market

主讲：Ming Hu，多伦多大学Rotman商学院运营管理专业副教授

2016年1月13日（星期三）上午10:00

信息管理与工程学院308会议室

（武东路100号上海财经大学）Scaling and Staffing for Call Center Management

主讲：张晓炜，香港科技大学工业工程和物流管理系助理教授

Dynamic Matching in a Two-Sided Market

主讲人介绍：Ming Hu is an Associate Professor of Operations Management at Rotman School of Management, University of Toronto. He received a master’s degree in Applied Mathematics from Brown University, and a Ph.D. in Operations Research from Columbia University. His research explores the interface between operations management and marketing, with a focus on analyzing strategic interactions among firms and between firms and consumers, in the context of revenue management, supply chain management and service operations management. His research has been published in Management Science, Operations Research, Marketing Science, Manufacturing & Service Operations Management, and Production and Operations Management. Most recently, he studies operations management in the context of social buying, crowdfunding, crowdsourcing, and two-sided markets.

讲座介绍：Motivated by the rise of the sharing economy, we consider an intermediary firm’s problem of dynamically matching demand and supply of heterogeneous types over a discrete-time horizon. More specifically, there are two finite disjoint sets of demand and supply types. Associated with each possible matching of a demand type and a supply type is a reward. In each period, demand and supply of various types arrive in random quantities. The firm’s problem is to decide on the optimal matching policy to maximize the total discounted rewards minus costs, given that unmatched demand and supply will incur waiting or holding costs, and will be carried over to the next period with abandonments.

For this general dynamic matching problem, we obtain a set of distribution-free structural results. First, using only matching rewards, we define a partial order between pairs of demand and supply types (which do not necessarily share a common demand or supply type). With this notion of partial order, we show it is optimal to prioritize the matching of the dominating pair over the dominated pair, and to greedily match a perfect pair that dominates all other pairs sharing a common demand or supply type. Second, we impose a reward structure in which types have (unidirectional) “taste” differences. For these horizontally differentiated types, we show that there exists a matching priority hierarchy related to “taste” locations: for any given demand (or supply) type, the closer its distance to a supply (or demand) type, the higher the priority to match the closer pair. Along the priority hierarchy, the optimal matching policy has a match-down-to structure for any pair of demand and supply types: there exist state-dependent thresholds; if the levels of demand and supply are higher than the thresholds, they should be matched down to the thresholds; otherwise, they should not be matched. Third, we impose a reward structure in which types have “quality” differences. For these vertically differentiated types, the optimal matching policy has an even simpler top-down matching structure (in short, “line up, match up”): line up demand types and supply types in descending order of their “quality” from high to low; match them from the top, down to some level. When demand and supply types have the same abandonment rate, the match-down-to levels have monotonicity properties with respect to the system state, and the one-step-ahead heuristic policy has a simplified state-dependent structure. Lastly, we study the deterministic counterpart of the stochastic problem and show that its solution can be obtained by solving a linear program or approximated by another linear program with much fewer decision variables. It is asymptotically optimal to re-solve the linear program successively for the current time and state and apply the solution as a heuristic policy, when the time and the arrivals of demand and supply are scaled up proportionally.

Scaling and Staffing for Call Center Management

**主讲人介绍：**Xiaowei Zhang is an AssistantProfessor in the Department of Industrial Engineering and Logistics Managementat Hong Kong University of Science and Technology. He received his Ph.D. inOperations Research from Stanford University in 2011. He is a member of INFORMSand his research interests include stochastic simulation and data-drivenservice engineering.

**讲座介绍：**The Poisson process has been an integralpart of many models for the arrival process to a telephone call centers.However, various publications in recent years suggest the presence of asignificant “overdisperson” relative to the Poisson process inreal-life call center arrival data. In this paper, we study the overdispersionin the context of heavy traffic and identify a critical factor thatcharacterizes the stochastic variability of the arrivals relative to theiraverages. We refer to such a factor as the scaling parameter as it determinesthe appropriate way to scale the arrival process in heavy traffic. Indeed, dataexhibits that the square-root scaling as in the conventional central limittheorem may not truly reflect the reality. We propose a new stochastic model tocapture the scaling parameter and develop the associated staffing rule in theQED (quality-and-efficiency driven) regime. The new staffing rule stipulatesthat in order to achieve a balance between quality-of-service and agentefficiency, the safety margin of the staffing level ought to have an order ofmagnitude that depends on the scaling parameter. In particular, in the presenceof overdispersion the safety margin has an higher order of magnitude than whatthe square-root staffing rule suggests. We apply the new staffing rule to realdata and find out it significantly outperforms the square-root staffing rule.