The article explores the outcomes in finite games, focusing on Nash equilibrium and correlated equilibrium. The researchers found that the set of Nash equilibrium payoffs in a bimatrix game can be represented as a finite union of rectangles in R^2. They also discovered that any finite union of rectangles can be the Nash equilibrium payoffs in a bimatrix game, with a polytope as the set of correlated equilibrium payoffs. The study also delves into the n-player case and how the results hold up when the payoff matrices are slightly changed.