{"id":"https://openalex.org/W2741901531","doi":"https://doi.org/10.24963/ijcai.2017/145","title":"The Tractability of the Shapley Value over Bounded Treewidth Matching Games","display_name":"The Tractability of the Shapley Value over Bounded Treewidth Matching Games","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2741901531","doi":"https://doi.org/10.24963/ijcai.2017/145","mag":"2741901531"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/145","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/145","pdf_url":"https://www.ijcai.org/proceedings/2017/0145.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0145.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087340443","display_name":"Gianluigi Greco","orcid":"https://orcid.org/0000-0002-5799-6828"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluigi Greco","raw_affiliation_strings":["University of Calabria","University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074964672","display_name":"Francesco Lupia","orcid":"https://orcid.org/0000-0003-0775-6890"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Lupia","raw_affiliation_strings":["University of Calabria","University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011519788","display_name":"Francesco Scarcello","orcid":"https://orcid.org/0000-0001-7765-1563"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Scarcello","raw_affiliation_strings":["University of Calabria","University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":2.7607,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.94008044,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1046","last_page":"1052"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9274535775184631},{"id":"https://openalex.org/keywords/shapley-value","display_name":"Shapley value","score":0.7474395632743835},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6486443281173706},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.644810676574707},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5312713384628296},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4919533431529999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47060427069664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45096829533576965},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4377695322036743},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4165537357330322},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35965293645858765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33113476634025574},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2748882472515106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2691715955734253},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.2620917558670044},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2619580626487732},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.23520806431770325},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2132134735584259},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10307130217552185},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0744747519493103}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9274535775184631},{"id":"https://openalex.org/C199022921","wikidata":"https://www.wikidata.org/wiki/Q240046","display_name":"Shapley value","level":3,"score":0.7474395632743835},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6486443281173706},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.644810676574707},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5312713384628296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4919533431529999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47060427069664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45096829533576965},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4377695322036743},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4165537357330322},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35965293645858765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33113476634025574},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2748882472515106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2691715955734253},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2620917558670044},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2619580626487732},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.23520806431770325},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2132134735584259},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10307130217552185},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0744747519493103},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/145","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/145","pdf_url":"https://www.ijcai.org/proceedings/2017/0145.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/145","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/145","pdf_url":"https://www.ijcai.org/proceedings/2017/0145.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2741901531.pdf","grobid_xml":"https://content.openalex.org/works/W2741901531.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W935602133","https://openalex.org/W1277554001","https://openalex.org/W1527664624","https://openalex.org/W1560161199","https://openalex.org/W2002430844","https://openalex.org/W2002722727","https://openalex.org/W2005690414","https://openalex.org/W2011039300","https://openalex.org/W2029140075","https://openalex.org/W2046116913","https://openalex.org/W2048652909","https://openalex.org/W2070240423","https://openalex.org/W2072395547","https://openalex.org/W2077569675","https://openalex.org/W2109100253","https://openalex.org/W2109716789","https://openalex.org/W2113370239","https://openalex.org/W2119468705","https://openalex.org/W2157841626","https://openalex.org/W2168454385","https://openalex.org/W2201560525","https://openalex.org/W2229001197","https://openalex.org/W2269436606","https://openalex.org/W2275184243","https://openalex.org/W2401216365","https://openalex.org/W2423871547","https://openalex.org/W6669769595","https://openalex.org/W6863994431"],"related_works":["https://openalex.org/W2091382007","https://openalex.org/W1539278744","https://openalex.org/W1582492864","https://openalex.org/W1810116456","https://openalex.org/W2964174631","https://openalex.org/W4300619607","https://openalex.org/W2889180046","https://openalex.org/W2143406303","https://openalex.org/W2803227791","https://openalex.org/W1836127928"],"abstract_inverted_index":{"Matching":[0],"games":[1,7,51,102],"form":[2],"a":[3,86],"class":[4],"of":[5,23,71,80,119],"coalitional":[6],"that":[8,34,94],"attracted":[9],"much":[10],"attention":[11],"in":[12,41,47],"the":[13,21,36,81,95],"literature.":[14],"Indeed,":[15],"several":[16],"results":[17],"are":[18],"known":[19,33],"about":[20],"complexity":[22],"computing":[24,35],"over":[25,50,69,104],"them":[26],"{solution":[27],"concepts}.":[28],"In":[29,55],"particular,":[30],"it":[31,57],"is":[32,39,83,98],"Shapley":[37,96],"value":[38,97],"intractable":[40],"general,":[42],"formally":[43],"#P-hard,":[44],"and":[45,115,124],"feasible":[46],"polynomial":[48],"time":[49],"defined":[52,103],"on":[53,117],"trees.":[54],"fact,":[56],"was":[58],"an":[59],"open":[60],"problem":[61],"whether":[62],"or":[63],"not":[64],"this":[65,90],"tractability":[66],"result":[67],"holds":[68],"classes":[70,118],"graphs":[72,105,120],"properly":[73],"including":[74],"acyclic":[75],"ones.":[76],"The":[77,109],"main":[78],"contribution":[79],"paper":[82],"to":[84,89],"provide":[85],"positive":[87],"answer":[88],"question,":[91],"by":[92],"showing":[93],"tractable":[99],"for":[100],"matching":[101],"having":[106,121],"bounded":[107],"treewidth.":[108],"proposed":[110],"technique":[111],"has":[112],"been":[113],"implemented":[114],"tested":[116],"different":[122],"sizes":[123],"treewidth":[125],"at":[126],"most":[127],"three.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}