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...
Κύριοι συγγραφείς: | 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, κ.ά.
Έκδοση: (2017) -
Pure Nash Equilibria: Hard and Easy Games
ανά: Gottlob, G, κ.ά.
Έκδοση: (2005) -
Pure Nash equilibria: hard and easy games
ανά: Gottlob, G, κ.ά.
Έκδοση: (2003) -
Nash and perfect equilibria of discounted repeated games
ανά: Fudenberg, Drew, κ.ά.
Έκδοση: (2011) -
On the complexity of Nash equilibria of action-graph games
ανά: Daskalakis, Constantinos, κ.ά.
Έκδοση: (2012)