This paper studies the long-run (stochastic) stability of an evolutionary model with persistent randomness in network games. We focus on evolutionary dynamics in symmetric coordination games where players choose the best responses to their opponents' strategies. Recent studies find that the...

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium

We give a mechanism fully implementing envy-free divisions such that: strategy spaces are symmetric, the set of Nash equilibria is a global attractor for the best-reply dynamics. As a byproduct, undesired mixed-strategy equilibria are weeded out by the adjustment process

We introduce strategic waiting in a global game setting with irreversible investment. Players can wait in order to make a better informed decision. We allow for cohort effects and discuss when they arise endogenously in technology adoption problems with positive contemporaneous network effects....

Consider an infinitely repeated game where each player is characterized by a "type" which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs...

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies it to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an...

In this paper, we analyze the consequences of taking noise into account in a simple two person fishery management game. Both a stochastic and deterministic formulation are considered. Compared to the noise-free model it is shown that the used stochastic framework has no implications for the...

In this note, we reconsider the indefinite open-loop Nash linear quadratic differential game with an infinite planning horizon. In particular, we derive both necessary and sufficient conditions under which the game will have a unique equilibrium

In this paper, we provide a numerical algorithm to calculate all soft-constrained Nash equilibria in a regular scalar indefinite linear-quadratic game. The algorithm is based on the calculation of the eigenstructure of a certain matrix. The analysis follows the lines of the approach taken by...