{"id":"https://openalex.org/W7162805023","doi":"https://doi.org/10.48550/arxiv.2605.29571","title":"Nucleolus Computation by Non-Zero-Constrained Optimization","display_name":"Nucleolus Computation by Non-Zero-Constrained Optimization","publication_year":2026,"publication_date":"2026-05-28","ids":{"openalex":"https://openalex.org/W7162805023","doi":"https://doi.org/10.48550/arxiv.2605.29571"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.29571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.29571","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120554099","display_name":"Daniel Ebert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ebert, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137361785","display_name":"Antonia Ellerbrock","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ellerbrock, Antonia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.902899980545044,"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.902899980545044,"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/T11031","display_name":"Game Theory and Applications","score":0.048900000751018524,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012299999594688416,"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/subspace-topology","display_name":"Subspace topology","score":0.5734000205993652},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5116999745368958},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4984999895095825},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4717000126838684},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46959999203681946},{"id":"https://openalex.org/keywords/nucleolus","display_name":"Nucleolus","score":0.44359999895095825},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41530001163482666}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6412000060081482},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5734000205993652},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5116999745368958},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4984999895095825},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46959999203681946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4478999972343445},{"id":"https://openalex.org/C183873130","wikidata":"https://www.wikidata.org/wiki/Q30869","display_name":"Nucleolus","level":3,"score":0.44359999895095825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43290001153945923},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41530001163482666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.29571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.29571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,44,143],"extend":[1],"the":[2,7,16,26,83,132,135,163,168,175,179,187,193],"list":[3],"of":[4,28,134,178,195],"games":[5,108],"where":[6],"nucleolus":[8,20,84,164,188],"is":[9,53,85,114,165,190],"computable":[10,86],"in":[11,87,125,167,174,186,192],"polynomial":[12,88],"time.":[13],"Based":[14],"on":[15],"classical":[17],"MPS":[18],"scheme,":[19],"computation":[21],"can":[22,181],"be":[23],"reduced":[24],"to":[25,39,55,75,117,183],"problem":[27,47],"finding":[29],"a":[30,40,63,146,184],"coalition":[31,64],"with":[32,65,109],"minimum":[33,66,136],"excess":[34,67,137],"that":[35,51,82,105,124,148,162,189],"does":[36],"not":[37,72],"belong":[38],"given":[41],"linear":[42,127,150],"subspace.":[43],"call":[45],"this":[46,78],"LSA-MinExcess,":[48],"and":[49,96],"show":[50,104,161],"it":[52],"equivalent":[54,116],"NZ-MinExcess:":[56],"Given":[57],"integral":[58],"values":[59,70],"per":[60],"player,":[61],"find":[62],"whose":[68],"player":[69],"do":[71],"sum":[73],"up":[74],"$0$.":[76],"Exploiting":[77],"representation,":[79],"we":[80,103,122,160],"prove":[81,123],"time":[89],"for":[90,106,140],"arboricity":[91],"games,":[92,95],"network":[93],"strength":[94],"certain":[97],"$b$-matching":[98,107],"games.":[99,142],"Along":[100],"these":[101],"lines,":[102],"$b":[110],"\\leq":[111],"2$,":[112],"LSA-MinExcess":[113],"polynomially":[115],"Shortest":[118],"Non-Zero":[119],"Cycle.":[120],"Further,":[121],"general,":[126],"subspace":[128,151],"avoidance":[129,152],"strictly":[130],"increases":[131],"complexity":[133],"problem,":[138],"even":[139],"monotone":[141],"still":[144],"provide":[145],"reduction":[147],"trades":[149],"against":[153],"an":[154],"arbitrarily":[155],"small":[156,172],"approximation":[157],"error.":[158],"Finally,":[159],"unstable":[166],"following":[169],"sense:":[170],"A":[171],"change":[173,185],"value":[176],"function":[177],"game":[180],"lead":[182],"exponential":[191],"number":[194],"players.":[196]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-30T00:00:00"}