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. They also discovered that any such set of payoffs can be achieved in a bimatrix game, with correlated equilibrium payoffs represented by a polytope containing the Nash equilibrium payoffs. The study also delves into the n-player case and how the results hold up when the payoff matrices are slightly changed.