Abstrakt
We determine Nash equilibria of a three-player Singled out game and show that players B and C can always select the equilibrium with maximal payoffs for both of them. We also study the long-term behavior of the game and show that for large n, both B and C will win with probability almost 1/2.