<div class="csl-bib-body">
<div class="csl-entry">Chen, J., Hatschka, C., & Simola, S. (2025). Partitioned Combinatorial Optimization Games. In I. Lynce, N. Murano, M. Vallati, S. Villata, F. Chesani, M. Milano, A. Omicini, & M. Dastani (Eds.), <i>ECAI 2025 : 28th European Conference on Artificial Intelligence : Including 14th Conference on Prestigious Applications of Intelligent Systems (PAIS 2025)</i>. IOS Press. https://doi.org/10.3233/FAIA250962</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/225332
-
dc.description.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.
en
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.subject
partitioned combinatorial optimization games
en
dc.subject
graph optimization
en
dc.subject
core stability verification
en
dc.subject
core stability existence
en
dc.title
Partitioned Combinatorial Optimization Games
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.editoraffiliation
University of Bologna, Italy
-
dc.relation.isbn
978-1-64368-631-8
-
dc.relation.doi
10.3233/FAIA413
-
dc.relation.grantno
VRG18-012
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
ECAI 2025 : 28th European Conference on Artificial Intelligence : Including 14th Conference on Prestigious Applications of Intelligent Systems (PAIS 2025)
-
tuw.container.volume
413
-
tuw.peerreviewed
true
-
tuw.relation.publisher
IOS Press
-
tuw.relation.publisherplace
Amsterdam
-
tuw.project.title
Structural and Algorithmic Aspects of Preference-based Problems in Social Choice
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.3233/FAIA250962
-
dc.description.numberOfPages
8
-
tuw.author.orcid
0000-0002-8163-1327
-
tuw.author.orcid
0000-0002-0881-8259
-
tuw.editor.orcid
0000-0003-1664-9632
-
tuw.editor.orcid
0000-0001-7379-1411
-
tuw.event.name
28th European Conference on Artificial Intelligence (ECAI 2025)
en
tuw.event.startdate
25-10-2025
-
tuw.event.enddate
30-10-2025
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Bologna
-
tuw.event.country
IT
-
tuw.event.presenter
Chen, Jiehua
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairetype
conference paper
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.cerifentitytype
Publications
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.orcid
0000-0002-8163-1327
-
crisitem.author.orcid
0000-0002-0881-8259
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
