Dynamic Coalitions in Games on Graphs with Preferences over Temporal Goals
A. Kaan Ata Yilmaz, Abhishek Kulkarni, Ufuk Topcu

TL;DR
This paper introduces a strategy synthesis method for multiplayer graph games with preferences over temporal goals, enabling dynamic coalition formation and demonstrating benefits over fixed coalitions through experiments.
Contribution
It extends admissibility concepts to graph games, defines a value function for strategy synthesis, and provides a polynomial-time algorithm with proven strategy existence.
Findings
Dynamic coalitions outperform fixed coalitions in certain scenarios.
Aligned preferences do not always promote cooperation.
Conflicting preferences do not necessarily lead to adversarial behavior.
Abstract
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies that jointly determine which coalitions should form and the actions coalition members should choose to satisfy their preferences in a subclass of deterministic multiplayer games on graphs. In these games, a leader decides the coalition during each round and the players not in the coalition follow their admissible strategies. Our contributions are threefold. First, we extend the concept of admissibility to games on graphs with preferences and characterize it using maximal sure winning, a concept originally defined for adversarial two-player games with preferences. Second, we define a value function that assigns a vector to each state, identifying which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Game Theory and Applications · Auction Theory and Applications
