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 some (generalized) matching game.

翻译：匹配游戏自然地将派任游戏( 众所周知的合作型游戏) 普遍化。 由于某些突破性结果和新应用, 匹配游戏的兴趣最近有所增长。 本次最新调查提供了匹配游戏和扩展的概览, 例如 $b$匹配游戏和分隔匹配游戏; 后者源于新出现的国际肾脏交换领域。 在这次调查中, 当输入仅限于某些( 通用) 匹配游戏时, 我们集中关注各种游戏理论解决方案概念的计算复杂性, 如核心、 核核糖核素和 Shapley 值 。