{"id":"https://openalex.org/W4415428722","doi":"https://doi.org/10.3233/faia250962","title":"Partitioned Combinatorial Optimization Games","display_name":"Partitioned Combinatorial Optimization Games","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428722","doi":"https://doi.org/10.3233/faia250962"},"language":null,"primary_location":{"id":"doi:10.3233/faia250962","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250962","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia250962","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101447443","display_name":"Jiehua Chen","orcid":"https://orcid.org/0000-0002-8163-1327"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Jiehua Chen","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-8163-1327","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023698793","display_name":"Christian Hatschka","orcid":"https://orcid.org/0000-0002-0881-8259"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christian Hatschka","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-0881-8259","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040384528","display_name":"Sofia Simola","orcid":"https://orcid.org/0000-0001-7941-0018"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sofia Simola","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0001-7941-0018","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101447443"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68474626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9442999958992004,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9442999958992004,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9217000007629395,"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/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5626999735832214},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5260000228881836},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5038999915122986},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4912000000476837},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4625999927520752},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4401000142097473},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4244000017642975},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4194999933242798}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6078000068664551},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5260000228881836},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4912000000476837},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4401000142097473},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4244000017642975},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4194999933242798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.415800005197525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4036000072956085},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3131999969482422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2962999939918518},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2685000002384186},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C2779521423","wikidata":"https://www.wikidata.org/wiki/Q3855646","display_name":"Combinatorial method","level":2,"score":0.26260000467300415}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia250962","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250962","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia250962","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250962","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"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,79,95],"propose":[1],"a":[2,19,24,28,31,40,45],"class":[3],"of":[4,15,18,21,58,61,72,100],"cooperative":[5],"games,":[6],"called":[7],"PARTITIONED":[8],"COMBINATORIAL":[9],"OPTIMIZATION":[10],"GAMEs":[11],"(PCOGs).":[12],"The":[13,56],"input":[14],"PCOG":[16],"consists":[17],"set":[20,43],"agents":[22,62],"and":[23,91,118],"combinatorial":[25],"structure":[26,37,50,74],"(typically":[27],"graph)":[29,46],"with":[30],"fixed":[32],"optimization":[33,107],"goal":[34],"on":[35,44],"this":[36],"(e.g.,":[38],"finding":[39],"minimum":[41,109,112,115],"dominating":[42,113],"such":[47],"that":[48],"the":[49,54,66,70,73,77,86,97],"is":[51,63],"divided":[52],"among":[53],"agents.":[55],"value":[57],"each":[59],"coalition":[60],"derived":[64],"from":[65],"optimal":[67],"solution":[68],"for":[69,103],"part":[71],"possessed":[75],"by":[76],"coalition.":[78],"study":[80],"two":[81],"fundamental":[82],"questions":[83,102],"related":[84],"to":[85],"core:":[87],"CORE":[88,92],"STABILITY":[89,93],"VERIFICATION":[90],"EXISTENCE.":[94],"analyze":[96],"algorithmic":[98],"complexity":[99],"both":[101],"four":[104],"classic":[105],"graph":[106],"tasks:":[108],"vertex":[110],"cover,":[111],"set,":[114],"spanning":[116],"tree,":[117],"maximum":[119],"matching.":[120]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-24T00:00:00"}