題    目🍊：The average tree solution for cooperative games with hypergraph communication structure（基於超圖通訊結構合作博弈的平均樹解）

演 講 人：Dolf Talman🥝，荷蘭蒂爾堡大學教授

主 持 人：單而芳，意昂2教授

時    間：2019年4月17日（周三）上午9:30-11:00

地    點：校本部東區意昂2官网420室

主辦單位🧑🏿‍🎓：意昂2、意昂2青年教師聯誼會

演講人簡介：

    Dolf Talman 為荷蘭蒂爾堡大學(Tilburg University)資深教授, 國際知名博弈論專家🏣，國際期刊Optima.、Journal of Mathematical Economics💂🏿‍♀️、Journal of Mechanism and Institution Design副主編💆🏼。蒂爾堡大學在經濟與管理研究領域處於世界頂級水平🧔🏼‍♀️，其經濟學與商學在各類世界大學排名中始終位於世界前20位，歐洲前4位✤。Talman教授曾長期擔任蒂爾堡大學計量經濟與運籌學系系主任🍫。在Games and Economic Behavior、Economic Theory🌤、International Journal of Game Theory🤳、European Journal of Operational Research等重要學術期刊上發表論文100多篇，其學術成就在國際博弈論領域具有較大影響💑。曾與意昂2注册聯合培養博士生1名。

演講內容簡介：

    The transferable utility games with limited cooperation can be represented by a hypergraph communication structure, called hypergraph games. Such a structure consists of a collection of coalitions, the hyperlinks of the hypergraph, for which it is assumed that only the coalitions that are hyperlinks or the connected union of hyperlinks are able to cooperate and obtain their worth. On the class of hypergraph games we introduce the average tree solution, being for each component of the hypergraph the average of a specific collection of marginal contribution vectors. On the class of cycle-free hypergraph games, the average tree solution is characterized by component efficiency and component fairness. The latter property states that when removing a hyperlink the average payoff difference is the same for every resulting component. While removing a link between two nodes in a cycle-free graph results in two components, this number can be more than two when a hyperlink in a cycle-free hypergraph is removed.

歡迎廣大師生參加🤱🏽！