Anna Maria Kerkmann

Anna Maria Kerkmann

Auto-generated profile, based on publicly available information

Anna Maria Kerkmann

Institut für Informatik, MNF, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2023 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Open access
PDF file
AKAnna Maria Kerkmann
Anna Maria Kerkmann
SCSimon Cramer
Simon Cramer
JRJörg Rothe
Jörg Rothe
Nguyen et al. (2016) introduced altruistic hedonic games in which agents’ utilities depend not only on their own preferences but also on those of their friends in the same coalition. We propose to extend their model to coalition formation games in general, considering also the friends in other coalitions. Comparing our model to altruistic hedonic games, we argue that excluding some friends from the altruistic behavior of an agent is a major disadvantage that comes with the restriction to hedonic games. After introducing our model and showing some desirable properties, we additionally study some common stability notions and provide a computational analysis of the associated verification and existence problems.

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
NBNiclas Boehmer
Niclas Boehmer
MBMartin Bullinger
Martin Bullinger
AKAnna Maria Kerkmann
Anna Maria Kerkmann
We study the formation of stable outcomes via simple dynamics in cardinal hedonic games, where the utilities of agents change over time depending on the history of the coalition formation process. Specifically, we analyze situations where members of a coalition decrease their utility for a leaving agent (resent) or increase their utility for a joining agent (appreciation). We show that in contrast to classical dynamics, for resentful or appreciative agents, dynamics are guaranteed to converge under mild conditions for various stability concepts. Thereby, we establish that both resent and appreciation are strong stability-driving forces.

1 October 2024 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Open access
PDF file
AKAnna Maria Kerkmann
Anna Maria Kerkmann
JRJörg Rothe
Jörg Rothe
We consider average- and min-based altruistic hedonic games and study the problem of verifying popular and strictly popular coalition structures. While strict popularity verification has been shown to be coNP-complete in min-based altruistic hedonic games, this problem has been open for equal- and altruistic-treatment average-based altruistic hedonic games. We solve these two open cases of strict popularity verification and then provide the first complexity results for popularity verification in (average- and min-based) altruistic hedonic games, where we cover all three degrees of altruism.

6 March 2024
Verified
Book Chapter
Closed access
PDF file
MHMatthias Hoffjan
Matthias Hoffjan
AKAnna Maria Kerkmann
Anna Maria Kerkmann
JRJörg Rothe
Jörg Rothe


20 December 2021 in International Journal of Semantic Computing
Verified
Journal Article
Closed access
PDF file
MTMarcel Tiator
Marcel Tiator
AKAnna Maria Kerkmann
Anna Maria Kerkmann
CGChristian Geiger
Christian Geiger
PGPaul Grimm
Paul Grimm