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: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for the Advancement of Artificial Intelligence
2017
|