Chip Multiprocessors (CMPs) and Non-Uniform Cache Architectures (NUCAs) represent two
emerging trends in computer architecture. Targeting future CMP based systems with NUCA …

Multiplayer games with selfish agents naturally occur in the design of distributed and
embedded systems. As the goals of selfish agents are usually neither equivalent nor …

We consider two-player non zero-sum infinite duration games played on weighted graphs.
We extend the notion of secure equilibrium introduced by Chatterjee et al., from the Boolean …

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs
with reachability objectives. In such games, each player aims at reaching his own goal set of …

We study the problem of finding robust equilibria in multiplayer concurrent games with mean
payoff objectives. A (k, t)-robust equilibrium is a strategy profile such that no coalition of size …

We show that under some general conditions the finite memory determinacy of a class of two-
player win/lose games played on finite graphs implies the existence of a Nash equilibrium …

We study optimal equilibrium in turn based multiplayer mean-payoff games. Nash
equilibrium are a standard way to define rational behaviour of different players in multi …

Concurrent game structures model multi-player games played on finite graphs where the
players simultaneously choose their moves and collectively determine the next state of the …

Iterated regret minimization has been introduced recently by JY Halpern and R. Pass in
classical strategic games. For many games of interest, this new solution concept provides …

Nash equilibrium (NE) is a central concept in game theory. Here we prove formally a
published theorem on existence of an NE in two proof assistants, Coq and Isabelle: starting …