{"id":"https://openalex.org/W7138303623","doi":"https://doi.org/10.1016/j.cor.2026.107468","title":"Cost-sharing mechanisms for the selfish maximum open-end bin packing problem","display_name":"Cost-sharing mechanisms for the selfish maximum open-end bin packing problem","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138303623","doi":"https://doi.org/10.1016/j.cor.2026.107468"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107468","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107468","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5108987209","display_name":"Zhikang Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhikang Zhang","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China"],"raw_orcid":"https://orcid.org/0009-0000-2765-6964","affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129703308","display_name":"Weidong Li","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weidong Li","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China"],"raw_orcid":"https://orcid.org/0000-0003-3094-4347","affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5129703308"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2642383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"191","issue":null,"first_page":"107468","last_page":"107468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8657000064849854,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8657000064849854,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.022600000724196434,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.02160000056028366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.718999981880188},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7038000226020813},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6062999963760376},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5990999937057495},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5299999713897705},{"id":"https://openalex.org/keywords/price-of-anarchy","display_name":"Price of anarchy","score":0.5200999975204468},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.44830000400543213},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4235000014305115}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.718999981880188},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7038000226020813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6913999915122986},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6062999963760376},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5990999937057495},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5299999713897705},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.5200999975204468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5184000134468079},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.44830000400543213},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4187000095844269},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.36079999804496765},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.313400000333786},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.30059999227523804},{"id":"https://openalex.org/C4305246","wikidata":"https://www.wikidata.org/wiki/Q3885225","display_name":"Least significant bit","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2026.107468","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107468","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4070309465","display_name":null,"funder_award_id":"KC-252511650","funder_id":"https://openalex.org/F4320324731","funder_display_name":"Yunnan University"}],"funders":[{"id":"https://openalex.org/F4320324731","display_name":"Yunnan University","ror":"https://ror.org/0040axw97"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1997598240","https://openalex.org/W2009126961","https://openalex.org/W2035351791","https://openalex.org/W2049967755","https://openalex.org/W2056606651","https://openalex.org/W2095094403","https://openalex.org/W2127353230","https://openalex.org/W2128578725","https://openalex.org/W2568989686","https://openalex.org/W2577702044","https://openalex.org/W2767440689","https://openalex.org/W2884181851","https://openalex.org/W2910573144","https://openalex.org/W2941710148","https://openalex.org/W2951304930","https://openalex.org/W2984328413","https://openalex.org/W2990672522","https://openalex.org/W2999963698","https://openalex.org/W3034380711","https://openalex.org/W3161015378","https://openalex.org/W3178859750","https://openalex.org/W3188651376","https://openalex.org/W3191380555","https://openalex.org/W4388191248","https://openalex.org/W4403118398","https://openalex.org/W4405021915","https://openalex.org/W4412447462","https://openalex.org/W7128239143"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2026-03-18T00:00:00"}