We present a two-firm model of predation under complete information, based on different discount factors, and integrate it with a model of collusion. Competition, collusion and predation are seen as alternative strategies. The basic conclusions are that t

Answering to an open question of Herings et al. (see [3]), one extends their fixed point theorem to mappings defined on convex compact subset of Rn, and not only polytopes. Such extension is important in non-cooperative game theory, where typical strategy sets are convex and compact. An...

In this paper, we present a more simple and independent proof of Reny's theorem (1998), on the existence of a Nash equilibrium in discontinue game, with a better-reply secure game in a Hausdorff topological vector space stronger than Reny's one. We will get the equivalence if the payoff function...

Properties of an average voting rule - the outcome being some weighted average of votes – are investigated, with particular attention to its ability to protect minorities. The unique average voting outcome is characterized with a median formula which depends on the voters’ preferred...

I study a regulatory process in which both the regulator and the regulated firm propose prices that in case of disagreement are settled through final-offer arbitration – a practice currently used in Chile for setting prices in the water sector. Rather than submitting a single offer, each party...

In this paper we present a set of axioms guaranteeing that, in exchange economies with or without indivisible goods, the set of Nash, Strong and active Walrasian Equilibria all coincide in the framework of market games.

In this work we propose a new model for spatial games. We present a definition of mobility in terms of the satisfaction an agent has with its spatial location. Agents compete for space through a non-cooperative game by using mixed strategies. We are particularly interested in studyig the...

We study the supercore of a system derived from a normal form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore of that system coincides with the set of Nash equilibrium strategy profiles of the last game in the sequence. This...

For finite games in strategic form it is shown that, in a Nash equlibrium, every player uses a strategy which is computable. However, there can exist no algorithm which is guaranteed to find an equilibrium for every instance of a game with computable payoffs. In contrast, an e-equilibrium is...

The paper investigates the sustainability of cooperative rules for the conduct of macroeconomic policy in a two-country world. The problem is set out as a supergame in which the threat strategy is to switch to a Nash non-cooperative equilibrium. A number of possible non-cooperative equilibria...