Due to their many applications, large Bayesian games have been a subject of growing interest in game theory and related fields. But to a large extent, models (1) have been restricted to one-shot interaction, (2) are based on an assumption that player types are independent and (3) assume that the...

We study whether we can weaken the conditions given in Reny (1999) and still obtain existence of pure strategy Nash equilibria in quasiconcave normal form games, or, at least, existence of pure strategy $\varepsilon-$equilibria for all epsilon0. We show by examples that there are: (1)...

This paper develops a dynamic evolutionary model in which agents make choices on the basis of relative performance criteria. We distinguish two classes of learned behavior: imitative dynamics and a new class of dynamics, "introspective dynamics." Under imitative dynamics, agents compare payoffs...

Se estudia la evolución de la competencia en el mercado español de electricidad, proponiendo un análisis mediante teoría de juegos. Se elabora un modelo basado en juegos dinámicos siguiendo el concepto de Equilibrio Perfecto de Markov, tomando como bloque elemental una descripción de la...

Convergence to Nash equilibrium in Cournot oligopoly is a problem that recurrently arises as a subject of study in economics. The development of evolutionary game theory has provided an equilibrium concept more directly connected with adjustment dynamics and the evolutionary stability of the...

Mirman (1979) and Levhari and Mirman (1980) suggested a simple two person multistage game-theoretical model which sheds some light on the economic implications inherent in the fishing conflicts where the decisions of the competitors have an effect on the evolution of the fish population and so,...

A class of non-cooperative constrained games is analysed for which the Ky Fan fuction is convex-concave. Nash equilibria of such games correspond to diagonal saddle points of the said function. This feature is exploited in designing computational algorithms for finding such equilibria.

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...