A polynomial-time algorithm synthesizes admissible strategies for a leader who dynamically forms coalitions with at most one partner in deterministic multiplayer games with temporal preferences.
Nash equilibrium in games with incomplete preferences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Coalitions in Games on Graphs with Preferences over Temporal Goals
A polynomial-time algorithm synthesizes admissible strategies for a leader who dynamically forms coalitions with at most one partner in deterministic multiplayer games with temporal preferences.