论文标题
匹配游戏的复杂性：调查
The Complexity of Matching Games: A Survey
论文作者
论文摘要
匹配游戏自然概括了作业游戏，这是一种众所周知的合作游戏。由于一些突破性结果和新应用程序，对匹配游戏的兴趣最近增长。这项最先进的调查概述了匹配的游戏和扩展名，例如$ b $匹配的游戏和划分的匹配游戏；后者起源于国际肾脏交易所的新兴领域。在这项调查中，当输入仅限于匹配的游戏时，我们将重点介绍各种游戏理论解决方案概念的计算复杂性方面，例如核心，核仁和沙普利价值。
Matching games naturally generalize assignment games, a well-known class of cooperative games. Interest in matching games has grown recently due to some breakthrough results and new applications. This state-of-the-art survey provides an overview of matching games and extensions, such as $b$-matching games and partitioned matching games; the latter originating from the emerging area of international kidney exchange. In this survey we focus on computational complexity aspects of various game-theoretical solution concepts, such as the core, nucleolus and Shapley value, when the input is restricted to a matching game or one if its variants.
