Speaker:Cao Zhigang, Professor, School of Economics and Management, Beijing Jiaotong University

Date:October. 28, 2021

Time:19:00-20:00

Location:Tencent Meeting, ID: 569 787 815

Sponsor:School of Mathematics, Shandong University

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 static analysis. We find that considering all edges simultaneously is the same as considering them separately. The concept of a 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 Tan Zhibin and Zou Zhengxin)

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/158359.htm