Synthesis of controllable nash equilibria in games with quantitative objectives
In Rational Synthesis, we consider a multi-agent system in which some of the agents are controllable and some are not. All agents have objectives, and the goal is to synthesize strategies for the controllable agents so that their objectives are satisfied, assuming rationality of the uncontrollable a...
Huvudupphovsmän: | Almagor, S, Kupferman, O, Perelli, G |
---|---|
Materialtyp: | Conference item |
Publicerad: |
International Joint Conferences on Artificial Intelligence Organization
2018
|
Liknande verk
Liknande verk
-
Nash equilibria in concurrent games with lexicographic preferences
av: Gutierrez, J, et al.
Publicerad: (2017) -
Pure Nash Equilibria: Hard and Easy Games
av: Gottlob, G, et al.
Publicerad: (2005) -
Pure Nash equilibria: hard and easy games
av: Gottlob, G, et al.
Publicerad: (2003) -
Nash and perfect equilibria of discounted repeated games
av: Fudenberg, Drew, et al.
Publicerad: (2011) -
On the complexity of Nash equilibria of action-graph games
av: Daskalakis, Constantinos, et al.
Publicerad: (2012)