We present a novel algorithm to determine the payoff-space of certain normal-form C1 parametric games, and - more generally - of continuous families of normal-form C1 games. The algorithm has been implemented by using MATLAB, and it has been applied to several examples. The implementation of the...

In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed equilibria of a finite decision form game. Many devel- opments...

In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed equilibria of a finite decision form game. Many devel- opments...

We present a novel algorithm to determine the payoff-space of certain normal-form C1 parametric games, and - more generally - of continuous families of normal-form C1 games. The algorithm has been implemented by using MATLAB, and it has been applied to several examples. The implementation of the...

In this paper we propose a concept of rationalizable solution for two-player decision-form games: the solution by iterated elimination of non-reactive strategies. Several original theorems are proved about this kind of solution. We study the relations between solutions by iterated elimination of...

In this paper we propose a concept of rationalizable solution for two-player decision-form games: the solution by iterated elimination of non-reactive strategies. Several original theorems are proved about this kind of solution. We study the relations between solutions by iterated elimination of...