Preference swaps for the stable matching problem

Eiben, Eduard; Gutin, Gregory; Neary, Philip R.; Rambaud, Clément; Wahlström, Magnus; Yeo, Anders

doi:10.1016/j.tcs.2022.11.003

Cited by 1 publication

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer to the work of Biró and Fleiner (2016) for a survey on results on NTU matching games and some natural open problems for these games and to a more recent paper of Király and Mészáros-Karkus (2019) for complexity results for NTU partitioned matching games, which they call international matching games. Furthermore, there is a large body of related work on core stabilizers in this setting; for example on the problem of minimizing the number of blocking pairs (Abraham et al, 2005;Biró et al, 2010), the problem of maximizing the number of vertices such that these pairs are stable among themselves (in our terminology, the vd-Stabilizer problem) (Tan, 1990), and on the topic of manipulative attacks (Boehmer et al, 2021;Chen et al, 2021;Eiben et al, 2023).…”

Section: Ntu Matching Gamesmentioning

confidence: 99%

The Complexity of Matching Games: A Survey

Benedek,

Biro,

Johnson

et al. 2023

jair

View full text Add to dashboard Cite

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 of its variants.

show abstract