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.

We define a duality of solutions in coalitional games that we call a twisted duality. This twisted duality extends the rule of self-duality in bankruptcy problems. After showing that the prekernel and prenucleolus exhibit twisted duality, we define a twisted reduced game property and...

A two-stage, two-person tournament is discussed, in which each player can influence the other one at the first stage by choosing help, sabotage or no action. At the second stage, the players choose effort to win the tournament. Helping and sabotaging have two effects — they influence the...

In this paper we study network structures in which the possibilities for cooperation are restricted and the benefits of a group of players depend on how these players are internally connected. One way to represent this type of situations is the so-called reward function, which represents the...