In this paper, we propose a new way to analyze bimatrix games. This new app
roach consists of considering the game as a bicriteria matrix game. The sol
ution concepts behind this game are based on getting the probability to ach
ieve some prespecified goals. We consider as a part of the solution, not on
ly the payoff values, but also the probability to get them. In addition, to
avoid the choice of only one goal, two different approaches are used. Firs
tly, sensitivity analysis of the solution set is carried out on the range o
f goals, secondly a partition of the goal space in a finite number of regio
ns is presented. Some examples are included to illustrate the results in th
e paper.