The Complexity of Matching Games: A Survey

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\)-matchi...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-06
Main Authors: Benedek, Márton, Biró, Péter, Johnson, Matthew, Paulusma, Daniël, Ye, Xin
Format: Article
Language:English
Subjects:
Complexity
Games
Matching
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Benedek, Márton
Biró, Péter
Johnson, Matthew
Paulusma, Daniël
Ye, Xin
description 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.
doi_str_mv 10.48550/arxiv.2202.06898
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2628906094</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2628906094</sourcerecordid><originalsourceid>FETCH-LOGICAL-a958-9832595370aa5ab75eed8c5ac6b1a66f470862ccd2b8a4c838e6184894bc3d483</originalsourceid><addsrcrecordid>eNotzc1Kw0AUQOFBEFpqH6C7AXdC4s2dn9xxV4JWoeLC7MvNZGJT2qZmktK-vYKuzu47QiwySDUZA4_cX9pzigiYgiVHN2KKSmUJacSJmMe4AwC0ORqjpuKh3AZZdIfTPlza4Sq7Rr7z4Lft8Uuu-BDik1zKz7E_h-uduG14H8P8vzNRvjyXxWuy_li9Fct1ws5Q4kihcUblwGy4yk0INXnD3lYZW9voHMii9zVWxNqTomAz0uR05VWtSc3E_R976rvvMcRhs-vG_vh73KBFcmDBafUDluFBgA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2628906094</pqid></control><display><type>article</type><title>The Complexity of Matching Games: A Survey</title><source>Publicly Available Content Database</source><creator>Benedek, Márton ; Biró, Péter ; Johnson, Matthew ; Paulusma, Daniël ; Ye, Xin</creator><creatorcontrib>Benedek, Márton ; Biró, Péter ; Johnson, Matthew ; Paulusma, Daniël ; Ye, Xin</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2202.06898</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Complexity ; Games ; Matching</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2628906094?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25731,27902,36989,44566</link.rule.ids></links><search><creatorcontrib>Benedek, Márton</creatorcontrib><creatorcontrib>Biró, Péter</creatorcontrib><creatorcontrib>Johnson, Matthew</creatorcontrib><creatorcontrib>Paulusma, Daniël</creatorcontrib><creatorcontrib>Ye, Xin</creatorcontrib><title>The Complexity of Matching Games: A Survey</title><title>arXiv.org</title><description>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.</description><subject>Complexity</subject><subject>Games</subject><subject>Matching</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotzc1Kw0AUQOFBEFpqH6C7AXdC4s2dn9xxV4JWoeLC7MvNZGJT2qZmktK-vYKuzu47QiwySDUZA4_cX9pzigiYgiVHN2KKSmUJacSJmMe4AwC0ORqjpuKh3AZZdIfTPlza4Sq7Rr7z4Lft8Uuu-BDik1zKz7E_h-uduG14H8P8vzNRvjyXxWuy_li9Fct1ws5Q4kihcUblwGy4yk0INXnD3lYZW9voHMii9zVWxNqTomAz0uR05VWtSc3E_R976rvvMcRhs-vG_vh73KBFcmDBafUDluFBgA</recordid><startdate>20230621</startdate><enddate>20230621</enddate><creator>Benedek, Márton</creator><creator>Biró, Péter</creator><creator>Johnson, Matthew</creator><creator>Paulusma, Daniël</creator><creator>Ye, Xin</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230621</creationdate><title>The Complexity of Matching Games: A Survey</title><author>Benedek, Márton ; Biró, Péter ; Johnson, Matthew ; Paulusma, Daniël ; Ye, Xin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a958-9832595370aa5ab75eed8c5ac6b1a66f470862ccd2b8a4c838e6184894bc3d483</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Complexity</topic><topic>Games</topic><topic>Matching</topic><toplevel>online_resources</toplevel><creatorcontrib>Benedek, Márton</creatorcontrib><creatorcontrib>Biró, Péter</creatorcontrib><creatorcontrib>Johnson, Matthew</creatorcontrib><creatorcontrib>Paulusma, Daniël</creatorcontrib><creatorcontrib>Ye, Xin</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Benedek, Márton</au><au>Biró, Péter</au><au>Johnson, Matthew</au><au>Paulusma, Daniël</au><au>Ye, Xin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Complexity of Matching Games: A Survey</atitle><jtitle>arXiv.org</jtitle><date>2023-06-21</date><risdate>2023</risdate><eissn>2331-8422</eissn><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 if its variants.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2202.06898</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2628906094
source Publicly Available Content Database
subjects Complexity
Games
Matching
title The Complexity of Matching Games: A Survey
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T23%3A20%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Complexity%20of%20Matching%20Games:%20A%20Survey&rft.jtitle=arXiv.org&rft.au=Benedek,%20M%C3%A1rton&rft.date=2023-06-21&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2202.06898&rft_dat=%3Cproquest%3E2628906094%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a958-9832595370aa5ab75eed8c5ac6b1a66f470862ccd2b8a4c838e6184894bc3d483%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2628906094&rft_id=info:pmid/&rfr_iscdi=true