一、题目

Local Comparative Statics for Minimum-Cost-Spanning-Tree Games

二、主讲人

曹志刚

三、摘要

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)

四、主讲人简介

曹志刚——北京交通大学经济管理学院“卓越百人计划”教授，国家优秀青年科学基金获得者。主要研究兴趣为博弈论及其应用，包括网络博弈和算法博弈论等。在相关领域主流刊物发表论文30余篇，包括Operations Research、Games and Economic Behavior、Journal of Mathematical Economics和Theoretical Computer Science等期刊以及ACM Economics & Computation等会议。

五、邀请人

徐进 数学学院副研究员

六、时间

10月28日（周四）19:00-20:00

七、地点

腾讯会议ID：569 787 815

八、主办方

山东大学数学学院