Prisoner's dilemma played by finite automata is reviewed again using a slightly modified measure of complexity. At a first step, an equilibrium with a large number of possible outcomes is shown to hold. At a second stage, we consider a game of repeated interaction, and show that on (limit)...

Consider G = (X1,…,XM,g1,…,gM) an M-player game in strategic form, where the set Xi is an interval of real numbers and the payoff functions gi are differentiable with respect to the related variable xi ∈ Xi. If they are also concave, with respect to the related variable, then it is...

We decompose the representative agent into her manager, worker and rentier selves. The criterion is the information set of each of the 'incarnations' at every stage of a repeated game. The rentier's information set includes anticipating information while the information set of the other agents...

This paper shows how strategic matching generates reputation-building behavior in an evolutionary chain-store game. Strategic matching means the possibility for an entrant to choose in a strategic way the local market into which it will move. Players are boundedly rational and follow behavioral...

This paper studies a transboundary pollution problem between two neighbour regions as a dynamic game. These two regions do not only share an environmental problem but they are also engaged in interregional trade. A good produced in one region is traded to the other which uses it as an input....

A formula is presented for computing the equilibrium payoffs in a generic finite two-person game when the support of the equilibrium is known.

I give necessary and sufficient conditions on the payoff set that guarantee uniqueness of the equilibrium in the Rubinstein bargaining model. The conditions encompass a class of non-convex or disconnected payoff sets with discontinuous Pareto frontiers. Roughly speaking, the equilibrium is...

A planar interception problem of a maneuverable target is considered using the linearized kinematic model with variable velocities and first-order dynamics of the interceptor and target. The maneuverabilities of the interceptor and target are assumed to be variable. By using an auxiliary...

A two-person general-sum repeated game with vanishing actions is an infinitely repeated game where the players face the following restrictions. Each action must be used by player k ∈ {1,2} at least once in every rk ∈ ℕ consecutive stages, otherwise the action vanishes for the remaining...

In this paper we study and compute E-points in an explicit way for diagonal games of three, four, five and n-players.