{"id":"https://openalex.org/W4416344190","doi":"https://doi.org/10.48550/arxiv.2511.11371","title":"Nucleolus, Happy Nucleolus, and Vehicle Routing","display_name":"Nucleolus, Happy Nucleolus, and Vehicle Routing","publication_year":2025,"publication_date":"2025-11-14","ids":{"openalex":"https://openalex.org/W4416344190","doi":"https://doi.org/10.48550/arxiv.2511.11371"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.11371","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.11371","pdf_url":"https://arxiv.org/pdf/2511.11371","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.11371","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/A5093701195","display_name":"Antonia Ellerbrock","orcid":"https://orcid.org/0009-0004-3056-5421"},"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.7541000247001648,"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.7541000247001648,"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.11590000241994858,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.023399999365210533,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6571000218391418},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5906999707221985},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.588699996471405},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5814999938011169},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4684000015258789},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.45809999108314514},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4372999966144562},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.41830000281333923}],"concepts":[{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6571000218391418},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5906999707221985},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5814999938011169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.503600001335144},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4787999987602234},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4124000072479248},{"id":"https://openalex.org/C20017120","wikidata":"https://www.wikidata.org/wiki/Q922087","display_name":"Superadditivity","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30090001225471497},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C11343654","wikidata":"https://www.wikidata.org/wiki/Q780008","display_name":"Solution concept","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.11371","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.11371","pdf_url":"https://arxiv.org/pdf/2511.11371","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.11371","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.11371","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":"pmh:oai:arXiv.org:2511.11371","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.11371","pdf_url":"https://arxiv.org/pdf/2511.11371","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,147],"study":[1,104],"the":[2,9,31,36,48,51,65,71,78,81,85,105,109,114,119,176,189],"recently":[3],"introduced":[4],"fair":[5],"division":[6],"concept":[7],"of":[8,67,80,96,108,153,168,191],"happy":[10,28,72],"nucleolus":[11,29,38,73],"for":[12,88,117,133,156,163,175],"cost":[13],"allocation":[14],"among":[15],"players":[16],"in":[17,70,84,113],"a":[18,68,136],"cooperative":[19],"game,":[20],"with":[21,40,135],"special":[22],"focus":[23,184],"on":[24,185,201],"its":[25,210],"computation.":[26],"The":[27],"applies":[30],"same":[32,82,177],"fairness":[33],"criterion":[34],"as":[35],"well-established":[37],"but":[39],"reduced":[41],"total":[42],"value.":[43],"Still,":[44],"we":[45,103,161,183],"show":[46,148],"that":[47],"relation":[49],"between":[50],"two":[52],"concepts":[53],"is":[54],"quite":[55],"involved,":[56],"and":[57,90,99,144,205,208],"intuitive":[58],"properties":[59],"do":[60],"not":[61],"hold":[62],"-":[63],"e.g.,":[64],"entry":[66,79],"player":[69,83],"can":[74,129],"be":[75,130],"larger":[76],"than":[77],"nucleolus,":[86],"even":[87],"monotone":[89,158],"subadditive":[91],"games.":[92],"This":[93],"refutes":[94],"conjectures":[95],"Meir,":[97],"Rosenschein":[98],"Malizia":[100],"(2011).":[101],"Further,":[102],"separation":[106],"problem":[107,178],"linear":[110,124],"programs":[111],"appearing":[112],"MPS":[115],"scheme":[116],"computing":[118],"(happy)":[120],"nucleolus.":[121],"It":[122],"includes":[123],"subspace":[125,180],"avoidance":[126],"constraints,":[127],"which":[128],"handled":[131],"efficiently":[132],"problems":[134],"certain":[137],"dynamic":[138],"programming":[139],"formulation":[140],"due":[141],"to":[142,150],"K\u00f6hnemann":[143],"Toth":[145],"(2020).":[146],"how":[149],"get":[151],"rid":[152],"these":[154],"constraints":[155],"all":[157],"games":[159,194],"if":[160],"allow":[162],"an":[164,197],"arbitrarily":[165],"small":[166],"error":[167],"epsilon,":[169],"thus":[170],"conserving":[171],"known":[172],"approximation":[173],"guarantees":[174],"without":[179],"avoidance.":[181],"Finally,":[182],"practical":[186],"results":[187],"at":[188],"example":[190],"vehicle":[192],"routing":[193],"by":[195],"designing":[196],"efficient":[198],"heuristic":[199],"based":[200],"our":[202],"previous":[203],"insights":[204],"past":[206],"work,":[207],"demonstrate":[209],"power.":[211]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-11-18T00:00:00"}