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...
Main Authors: | Almagor, S, Kupferman, O, Perelli, G |
---|---|
פורמט: | Conference item |
יצא לאור: |
International Joint Conferences on Artificial Intelligence Organization
2018
|
פריטים דומים
-
Nash equilibria in concurrent games with lexicographic preferences
מאת: Gutierrez, J, et al.
יצא לאור: (2017) -
Pure Nash Equilibria: Hard and Easy Games
מאת: Gottlob, G, et al.
יצא לאור: (2005) -
Pure Nash equilibria: hard and easy games
מאת: Gottlob, G, et al.
יצא לאור: (2003) -
Nash and perfect equilibria of discounted repeated games
מאת: Fudenberg, Drew, et al.
יצא לאור: (2011) -
On the complexity of Nash equilibria of action-graph games
מאת: Daskalakis, Constantinos, et al.
יצא לאור: (2012)