# The Complexity of Matching Games: A Survey

arXiv: https://arxiv.org/abs/2202.06898 · HTML: https://mlsanity.com/paper/2202.06898/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Feb 2022.

## Built on by (most cited first, 2 of 2)

- [Fair Indivisible Payoffs through Shapley Value](https://mlsanity.com/paper/2510.24906/) (2025)
- [Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem](https://mlsanity.com/paper/2609.25056/) (2026)

## Abstract (arXiv)

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.