Strategic games are considered where the players derive their utilities from participation in certain 'processes.' Two subclasses consisting exclusively of potential games are singled out. In the first, players choose where to participate, but there is a unique way of participation, the same for...

We consider Salim Rashid's asymptotic version of David Schmeidler's theorem on the purification of Nash equilibria. We show that, in contrast to what is stated, players' payoff functions have to be selected from an equicontinuous family in order for Rashid's theorem to hold. That is, a bound on...

We consider an asymptotic version of Mas-Colell's theorem on the existence of pure strategy Nash equilibria in large games. Our result states that, if players' payoff functions are selected from an equicontinuous family, then all sufficiently large games have an epsilon - pure, epsilon -...

We show that a strategy is a Nash equilibrium in a game with a continuum of players if and only if there exists a sequence of finite games such that its restriction is an $\varepsilon_n$-equilibria, with $\varepsilon_n$ converging to zero. In our characterization, the sequence of finite games...

This paper generalizes previous existence results on unidimensional electoral competition, by extending the traditional two-party electoral game to the case where parties have mixed motivations, in the sense that they are interested in winning the election, but also in the policy implemented...

We characterize Nash equilibria of games with a continuum of players (Mas-Colell (1984)) in terms of approximate equilibria of large finite games. For the concept of $(\epsilon,\epsilon)$ - equilibrium --- in which the fraction of players not $\epsilon$ - optimizing is less than $\epsilon$ ---...

The results of Ultimatum Game experiments are often quoted as evidence for the role of fairness in bargaining or in economic behaviour more generally. This paper argues that the observed fairness levels are contingent on the traditional experimental design where players are newly matched each...

We present a quantum solution to coordination problems that can be implemented with present technologies. It provides an alternative to existing approaches, which rely on explicit communication, prior commitment or trusted third parties. This quantum mechanism applies to a variety of scenarios...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that this process converges...