Benedek, Márton and Biró, Péter and Johnson, Matthew and Paulusma, Daniel and Ye, Xin (2023) The Complexity of Matching Games : A Survey. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 77. pp. 459-485. ISSN 1076-9757
|
Text
14281wPgs.pdf Available under License Creative Commons Attribution. Download (414kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | autonomous agents, game theory |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 16 Jun 2023 14:06 |
| Last Modified: | 16 Jun 2023 14:06 |
| URI: | http://real.mtak.hu/id/eprint/167919 |
Actions (login required)
 |
Edit Item |
