Although it has been known since the 1970s that a globally optimal strategy profile in a
common-payoff game is a Nash equilibrium, global optimality is a strict requirement that …

We distinguish among three types of symmetric games, which we name ordinary symmetric
games, renaming symmetric games, and name-irrelevant symmetric games, in an order of …

This paper considers symmetry in games with more than two players. It is often noted that a
two-player game is symmetric if it looks the same to both players. However, when there are …

This paper extends the notion of learning algorithms and learning equilibriums from
repeated games theory to stochastic games. We introduce Foolproof Cooperative Learning …

Concurrent multi-player games with $\omega $-regular objectives are a standard model for
systems that consist of several interacting components, each with its own objective. The …

This paper regards symmetry in games with more than two players. It is often said that a two-
player game is symmetric if it looks the same to both players. However, there are n-player …

Although it has been known since the 1970s that a globally optimal strategy profile in a
common-payoff game is a Nash equilibrium, global optimality is a strict requirement that …

In this paper we survey various notions of anonymity and symmetry for finite strategic-form
games present in relevant literature, and discuss notions of fairness; show that game …

In this paper, we distinguish three types of symmetric games, namely, ordinary symmetric
games, renaming symmetric games and name-irrelevant symmetric games, in an order of …

Game-based verification and synthesis Page 1 General rights Copyright and moral rights for
the publications made accessible in the public portal are retained by the authors and/or other …