學術報告一
報告題目： Facility Location Games and Resource Auction Games
報 告 人： 李閩溟副教授， 香港城市大學
報告時間： 2018年5月10日 2:00-3:00PM
報告地點： 太阳成集团tyc234cc工學一号館216室
簡介：
李閩溟博士是香港城市大學計算機系副教授。他分别于2002及2006年在清華計算機科學與技術系取得本科和博士學位。他的主要研究興趣是算法博弈論，組合優化，以及調度與排序問題中的算法設計與分析。
Dr. Minming Li is currently an associate professor in the Department of Computer Science, City University of Hong Kong. He received his Ph. D. and B.E. degree in the Department of Computer Science and Technology at Tsinghua University in 2006 and 2002 respectively. His research interests include algorithmic game theory, combinatorial optimization, and algorithm design and analysis for scheduling problems.
Abstract：Mechanism Design, as one of the important areas in algorithmic game theory, can be classified into two categories: with money and without money.Facility location game is one of the mostly studied problem in mechanism design without money. Procaccia and tennenholtz proposed and studied the problem back in 2009, where there are n agents on a line and the government will build a facility in a certain location given the agents reported information on their positions. Since every agent wants the facility to be closer to her, the government wants to make sure truth-telling is the best strategy for every agent while achieving some optimization objective. Since then, some bounds on the approximation ratios of the truthful mechanisms have been improved and new models are proposed. In this talk, we will briefly explain the story of the classic model and emphasize on therecent development on new models proposed by us and other groups. On the other hand, a resource auction model will also be briefly discussed where jobs bid for time slots from the virtual machines and the objective of the cloud is to elicit truth information from the jobs while maximizing the revenue.
學術報告二
報告題目：Service Matching with Uncertain Outcomes
報 告 人：齊向彤教授， 香港科技大學
報告時間： 2018年5月10日 3:00-4:00PM
報告地點： 太阳成集团tyc234cc工學一号館216室
簡介：
齊向彤博士是香港科技大學工業工程及決策分析學系教授。 他的主要研究興趣是運籌學和博弈論，應用領域包括制造，物流，供應鍊，以及通訊網絡等。他的學術期刊編輯經曆包括IIE Transactions, IEEE TASE, APJOR 和 FSM，并為以下公司提供咨詢服務：HIT, HACTL, Huawei等.
Dr. Xiangtong Qi is Professor in the Department of Industrial Engineering and Decision Analytics at The Hong Kong University of Science and Technology. His research interests are operations research and game theory, with applications in service, production, logistics, supply chain, and communication networks. His editorial experience includes Associate Editorship for IIE Transactions, IEEE TASE, APJOR and FSM. He has done industrial consulting projects for HIT, HACTL, Huawei, etc.
Abstract：We consider a model of assigning a set off servers to dynamically arrived demands, where the outcome is a random reward function of the demand and the number of servers assigned. We show that there exists one type of policy that is optimal to different reward functions. The model has potential for a variety of applications such as sharing economy, online ad auction, charity, and so on.
學術報告三
報告題目：Network Slicing: How Much Resource to Ask and How to Measure the Performance
報 告 人： 汪建平副教授， 香港城市大學
報告時間： 2018年5月10日 4:00-5:00PM
報告地點： 太阳成集团tyc234cc工學一号館216室
簡介：
汪建平博士是香港城市大學計算機系副教授。加入香港城市大學之前，她曾在美國南佐治亞大學，密西西比大學擔任助理教授。她的主要研究興趣是雲計算，面向服務的網絡，無線傳感網絡，光網絡及網絡性能測量。她是IEEE Transactions on Mobile Computing 以及 Optical Switching and Networking 雜志的編輯。她的研究獲得美國自然科學基金，中國自然科學基金，香港研究局，香港創新科技局，谷歌，華為及美國Xinova公司資助。
Dr. Jianping Wang is an associate Professor in the department of Computer Science at City University of Hong Kong. Prior to joining City University of Hong Kong, she was an assistant professor at University of Mississippi and Georgia Southern University. Her main research interests are cloud computing, service oriented networking, wireless sensor networks, optical networking, and network performance measurements. She is an associate editor of IEEE Transactions on Mobile Computing and an associate editor of Optical Switching and Networking. Her research has been sponsored by US NSF, NSFC, Hong Kong Research Grant Council, Hong Kong Innovation Technology Council, Google, Huawei, and Xinova (US).
Abstract：In today's telecommunication industry, a grand challenge faced by many network service providers (NSPs) is how to cost-effectively allocate resources so as to agilely accommodate a variety of applications and services with diverse quality-of-service (QoS) requirements. To address this challenge, a promising technology is network slicing, with which tenants, can create different network slices with desired performance guarantees on the same network infrastructure. In the past three years, network slicing has attracted significant attention from academia and industry. However, most existing studies have focused on how to dynamically partition a physical network infrastructure into many network slices, and thus assumed that each tenant knows the right amount of resources which is necessary to accommodate certain traffic load with performance guarantees. This assumption causes a gap between tenants and NSPs, which compromises the adoption of network slicing. In this talk, we first introduce how to model the relationship among traffic load, resource, and performance. With this model, given the traffic load and desired performance, we can derive the amount of resource to be provisioned. We then introduce a network tomography based approach to infer a set of interested paths with the minimum number of monitors.
