Lecturer:Cao Zhigang

Abstract:

The minimum-cost-spanning-tree (m.c.s.t.) game is a classical cooperative game model that has many applications. We consider the problem of decreasing the connection costs as much as possible in an m.c.s.t. game such that its core does not change. This could be viewed as a local comparative statics analysis. We find that considering all edges simultaneously is the same as considering them separately. The concept of an matrix-exact cover for an m.c.s.t. game is a natural analogue of the well-known exact cover for a cooperative game explored by Schmeidler (1972), and there are some close relationships between them. Our results improve the understanding of the exact cover for m.c.s.t. games explored by Trudeau and Vidal-Puga (2017). (joint work with Zhibin Tan and Zhengxin Zou)

Introduction to the Lecturer:

Cao Zhigang is a professor of the "Distinguished Hundred Talents Program" of the School of Economics and Management, Beijing Jiaotong University, and winner of the National Science Foundation for Distinguished Young Scholars. His main research interests include game theory and its applications, including network game theory and algorithmic game theory. He has published more than 30 papers in journals such asOperations Research,Games and Economic Behavior,Journal of Mathematical EconomicsandTheoretical Computer Scienceas well as on conferences such as ACM Economics & Computation.

Invitee:

Xu Jin, Associate Researcher from School of Mathematics

Time:

19:00-20:00, October 28 (Thursday)

Venue:

Tencent Meeting ID: 569 787 815

Hosted by the School of Mathematics, Shandong University