EUVIMEDEUVIMED entdecken
Crossref

The Complexity of Matching Games: A Survey

Marton Benedek, Peter Biro, Matthew Johnson, Daniel Paulusma, Xin Ye

Journal of Artificial Intelligence Research · 12.06.2023 · 77 · 459-485

DOI: 10.1613/jair.1.14281 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Artificial Intelligence Research, online erschienen am 12.06.2023. Verfasst von Marton Benedek und 4 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Benedek, M., Biro, P., Johnson, M., Paulusma, D., & Ye, X. (2023). The Complexity of Matching Games: A Survey. Journal of Artificial Intelligence Research, 77, 459-485. https://doi.org/10.1613/jair.1.14281

Vancouver

Benedek M, Biro P, Johnson M, Paulusma D, Ye X. The Complexity of Matching Games: A Survey. Journal of Artificial Intelligence Research. 2023;77:459-485. doi:10.1613/jair.1.14281

BibTeX
@article{Benedek2023,
  author = {Benedek, Marton and Biro, Peter and Johnson, Matthew and Paulusma, Daniel and Ye, Xin},
  title = {The Complexity of Matching Games: A Survey},
  journal = {Journal of Artificial Intelligence Research},
  year = {2023},
  volume = {77},
  pages = {459--485},
  doi = {10.1613/jair.1.14281}
}
Kostenlos starten →