@inproceedings{3f3ef909e84b46409821ebb9d78e3cff,
title = "Partitioned Combinatorial Optimization Games",
abstract = "We propose a class of cooperative games, called PARTITIONED COMBINATORIAL OPTIMIZATION GAMEs (PCOGs). The input of PCOG consists of a set of agents and a combinatorial structure (typically a graph) with a fixed optimization goal on this structure (e.g., finding a minimum dominating set on a graph) such that the structure is divided among the agents. The value of each coalition of agents is derived from the optimal solution for the part of the structure possessed by the coalition. We study two fundamental questions related to the core: CORE STABILITY VERIFICATION and CORE STABILITY EXISTENCE. We analyze the algorithmic complexity of both questions for four classic graph optimization tasks: minimum vertex cover, minimum dominating set, minimum spanning tree, and maximum matching.",
author = "Jiehua Chen and Christian Hatschka and Sofia Simola",
note = "Publisher Copyright: {\textcopyright} 2025 The Authors.; 28th European Conference on Artificial Intelligence, ECAI 2025, including 14th Conference on Prestigious Applications of Intelligent Systems, PAIS 2025 ; Conference date: 25-10-2025 Through 30-10-2025",
year = "2025",
month = oct,
day = "21",
doi = "10.3233/FAIA250962",
language = "English",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "1429--1436",
editor = "Ines Lynce and Nello Murano and Mauro Vallati and Serena Villata and Federico Chesani and Michela Milano and Andrea Omicini and Mehdi Dastani",
booktitle = "ECAI 2025 - 28th European Conference on Artificial Intelligence, including 14th Conference on Prestigious Applications of Intelligent Systems, PAIS 2025 - Proceedings",
address = "Netherlands",
}