Nash equilibria in concurrent games with lexicographic preferences
We study concurrent games with finite-memory strategies where players are given a B¨uchi and a mean-payoff objective, which are related by a lexicographic order: a player first prefers to satisfy its B¨uchi objective, and then prefers to minimise costs, which are given by a mean-payoff function. In...
Main Authors: | Gutierrez, J, Murano, A, Perelli, G, Rubin, S, Wooldridge, M |
---|---|
Format: | Conference item |
Published: |
Association for the Advancement of Artificial Intelligence
2017
|
Similar Items
-
A tool for the automated verification of Nash equilibria in concurrent games
by: Toumi, A, et al.
Published: (2015) -
Pure Nash Equilibria in Concurrent Deterministic Games
by: Patricia Bouyer, et al.
Published: (2015-06-01) -
Equilibria of concurrent games on event structures
by: Gutierrez, J, et al.
Published: (2014) -
Synthesis of controllable nash equilibria in games with quantitative objectives
by: Almagor, S, et al.
Published: (2018) -
Reasoning about equilibria in game-like concurrent systems
by: Gutierrez, J, et al.
Published: (2016)