A refinement of the concept of equilibrium in multiple objective continous games.
R. INFANTE AND F. R. FERNÁNDEZ J. PUERTO (1999)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
Displaying similar documents to “A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria”
A refinement of the concept of equilibrium in multiple objective continous games.
Coevolutionary genetic algorithms for establishing Nash equilibrium in symmetric Cournot games.
Protopapas, Mattheos K., Battaglia, Francesco, Kosmatopoulos, Elias B. (2010)
Advances in Decision Sciences
Similarity:
Permissive strategies: from parity games to safety games
Julien Bernet, David Janin, Igor Walukiewicz (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler...
Carrying umbrellas: An online relocation game on a graph.
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
Permissive strategies : from parity games to safety games
Julien Bernet, David Janin, Igor Walukiewicz (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...