We study pure Nash equilibria (PNE) in games with i.i.d. random payoffs. These games are characterized by N players with two possible strategies per player and can be represented as partially oriented graphs. We examine the properties of PNE, such as their existence in a game, and convergence to equilibrium in these games.