{"id":"https://openalex.org/W2072395547","doi":"https://doi.org/10.1145/2692372.2692374","title":"The Complexity of the Nucleolus in Compact Games","display_name":"The Complexity of the Nucleolus in Compact Games","publication_year":2015,"publication_date":"2015-01-13","ids":{"openalex":"https://openalex.org/W2072395547","doi":"https://doi.org/10.1145/2692372.2692374","mag":"2072395547"},"language":"en","primary_location":{"id":"doi:10.1145/2692372.2692374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2692372.2692374","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066443441","display_name":"Enrico Malizia","orcid":"https://orcid.org/0000-0002-6780-4711"},"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":"Enrico Malizia","raw_affiliation_strings":["University of Calabria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055479421","display_name":"Luigi Palopoli","orcid":"https://orcid.org/0000-0003-4915-5137"},"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":"Luigi Palopoli","raw_affiliation_strings":["University of Calabria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","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":12.0978,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.98042444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"7","issue":"1","first_page":"1","last_page":"52"},"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.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T11182","display_name":"Auction Theory and Applications","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6457589268684387},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5249326825141907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.514255940914154},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4919411838054657},{"id":"https://openalex.org/keywords/solution-concept","display_name":"Solution concept","score":0.46694982051849365},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4267116189002991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42608022689819336},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42068466544151306},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4173603057861328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40846455097198486},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3556472659111023},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.29405897855758667},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.26634907722473145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2507672607898712},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13379836082458496}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6457589268684387},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5249326825141907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.514255940914154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4919411838054657},{"id":"https://openalex.org/C11343654","wikidata":"https://www.wikidata.org/wiki/Q780008","display_name":"Solution concept","level":3,"score":0.46694982051849365},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4267116189002991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42608022689819336},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42068466544151306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4173603057861328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40846455097198486},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3556472659111023},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.29405897855758667},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26634907722473145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2507672607898712},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13379836082458496},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2692372.2692374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2692372.2692374","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/31581","is_oa":false,"landing_page_url":"http://hdl.handle.net/10871/31581","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:cris.unibo.it:11585/792007","is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?doid=2692372.2692374","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/489f7229-dbaf-4817-bd25-e31782132a49","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/489f7229-dbaf-4817-bd25-e31782132a49","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Greco, G, Malizia, E, Palopoli, L & Scarcello, F 2015, 'The Complexity of the Nucleolus in Compact Games', ACM Transactions on Computation Theory, vol. 7, no. 1, 3. https://doi.org/10.1145/2692372.2692374","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320326073","display_name":"Regione Calabria","ror":"https://ror.org/03swz0133"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W62192591","https://openalex.org/W206384230","https://openalex.org/W1482738693","https://openalex.org/W1550331971","https://openalex.org/W1609615991","https://openalex.org/W1963547452","https://openalex.org/W1965547292","https://openalex.org/W1975794688","https://openalex.org/W1979746590","https://openalex.org/W1987344946","https://openalex.org/W1987820184","https://openalex.org/W1989936306","https://openalex.org/W1992083423","https://openalex.org/W2002430844","https://openalex.org/W2020121184","https://openalex.org/W2026745519","https://openalex.org/W2029140075","https://openalex.org/W2046116913","https://openalex.org/W2046377545","https://openalex.org/W2048390614","https://openalex.org/W2053913299","https://openalex.org/W2057384682","https://openalex.org/W2057512592","https://openalex.org/W2061291436","https://openalex.org/W2063462490","https://openalex.org/W2063810092","https://openalex.org/W2064536758","https://openalex.org/W2066311617","https://openalex.org/W2067219566","https://openalex.org/W2073544949","https://openalex.org/W2074062423","https://openalex.org/W2080430389","https://openalex.org/W2084146358","https://openalex.org/W2087243523","https://openalex.org/W2101421259","https://openalex.org/W2102242479","https://openalex.org/W2109100253","https://openalex.org/W2115064460","https://openalex.org/W2116198645","https://openalex.org/W2118832894","https://openalex.org/W2119529665","https://openalex.org/W2125363721","https://openalex.org/W2133362358","https://openalex.org/W2133953743","https://openalex.org/W2139718531","https://openalex.org/W2143039680","https://openalex.org/W2144846366","https://openalex.org/W2148042319","https://openalex.org/W2150482096","https://openalex.org/W2165398588","https://openalex.org/W2166830413","https://openalex.org/W2167073044","https://openalex.org/W2167607952","https://openalex.org/W2212441983","https://openalex.org/W2212662287","https://openalex.org/W2229001197","https://openalex.org/W2231698414","https://openalex.org/W2292224385","https://openalex.org/W2310516540","https://openalex.org/W2340985688","https://openalex.org/W2748837517","https://openalex.org/W2763349972","https://openalex.org/W2796137918","https://openalex.org/W3124653719","https://openalex.org/W3137934641","https://openalex.org/W3155552712","https://openalex.org/W4300645277"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W2165950148","https://openalex.org/W4253593777","https://openalex.org/W2951497643","https://openalex.org/W4300101996","https://openalex.org/W3101625811","https://openalex.org/W2338854850","https://openalex.org/W2107423006"],"abstract_inverted_index":{"The":[0,20,145,183],"nucleolus":[1,21,161,238,323],"is":[2,22,134,148,186,194,221,245,294,312],"a":[3,87,152,166,200,282,306,325],"well-known":[4],"solution":[5,232],"concept":[6,233],"for":[7,160,168,197,209,320],"coalitional":[8,32,273],"games":[9,37],"to":[10,24,28,77,206,213,223,305],"fairly":[11],"distribute":[12],"the":[13,18,41,97,110,113,138,155,203,214,219,237,251,262,277,296,322],"total":[14],"available":[15],"worth":[16,42,252],"among":[17],"players.":[19,264],"known":[23,222,313],"be":[25,207,224,318],"NP":[26],"-hard":[27],"compute":[29],"over":[30,36,55,65,83,227],"compact":[31,126],"games,":[33,69,71,127,229,274],"that":[34,120,131,242,257,298],"is,":[35,258],"whose":[38],"functions":[39,54],"specifying":[40],"associated":[43],"with":[44,230,247,261],"each":[45,243],"coalition":[46],"are":[47,176,291],"encoded":[48],"in":[49,96,180,285,303,314,324],"terms":[50],"of":[51,112,125,142,154,178,202,272,279,281,309],"polynomially":[52],"computable":[53,226],"combinatorial":[56,191],"structures.":[57],"In":[58,217],"particular,":[59],"hardness":[60,184],"results":[61],"have":[62],"been":[63],"exhibited":[64],"minimum":[66],"spanning":[67],"tree":[68],"threshold":[70],"and":[72,99,107,128,163,316],"flow":[73],"games.":[74,144],"However,":[75],"due":[76],"its":[78,92],"intricate":[79],"definition":[80],"involving":[81],"reasoning":[82,169],"exponentially":[84],"many":[85,289],"coalitions,":[86],"nontrivial":[88],"upper":[89,118,146],"bound":[90,119,133,147],"on":[91,122,137,188,276],"complexity":[93,111],"was":[94],"missing":[95],"literature":[98],"looked":[100],"for.":[101],"This":[102],"article":[103,267],"faces":[104],"this":[105,132,231,266],"question":[106],"precisely":[108],"characterizes":[109],"nucleolus,":[114],"by":[115,129,150,164],"exhibiting":[116],"an":[117,189],"holds":[121],"any":[123],"class":[124,141],"showing":[130],"tight":[135],"even":[136],"(structurally":[139],"simple)":[140],"graph":[143,228],"established":[149],"proposing":[151],"variant":[153],"standard":[156],"linear-programming":[157],"based":[158,187,275],"algorithm":[159],"computation":[162],"studying":[165],"framework":[167],"about":[170],"succinctly":[171],"specified":[172],"linear":[173],"programs,":[174],"which":[175,193,311],"contributions":[177],"interest":[179],"their":[181],"own.":[182],"result":[185],"elaborate":[190],"reduction,":[192],"conceptually":[195],"relevant":[196,269],"it":[198,248,293],"provides":[199],"\u201cmeasure\u201d":[201],"computational":[204],"cost":[205],"paid":[208],"guaranteeing":[210,241],"voluntary":[211],"participation":[212],"distribution":[215],"process.":[216],"fact,":[218],"pre-nucleolus":[220],"efficiently":[225],"being":[234],"defined":[235],"as":[236],"but":[239],"without":[240,259],"player":[244],"granted":[246],"at":[249],"least":[250],"she":[253],"can":[254],"get":[255],"alone,":[256],"collaborating":[260],"other":[263],"Finally,":[265],"identifies":[268],"tractable":[270],"classes":[271],"notion":[278],"type":[280],"player.":[283],"Indeed,":[284],"most":[286],"applications":[287],"where":[288],"players":[290,300],"involved,":[292],"often":[295],"case":[297],"such":[299],"do":[301],"belong":[302],"fact":[304],"limited":[307],"number":[308],"classes,":[310],"advance":[315],"may":[317],"exploited":[319],"computing":[321],"fast":[326],"way.":[327]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2016-06-24T00:00:00"}