Nash equilibrium is shown to exist for every game. In symmetric bimatrix games, our results imply the existence of a …

evolutionary forces in games played repeatedly in large populations of boundedly rational agents. The approach is macro oriented in …

toward the anchor in games where choices are strategic substitutes. …

models of communication and hierarchy restrictions in cooperative games, compare different network structures with each other … illustrate these network structures by applying them to cooperative games with restricted cooperation. …

-market entry games. More generally, the algorithm facilitates simulated maximum likelihood (SML) estimation of games with large … numbers of players, T, and/or many binary actions per player, M (e.g., games with tens of thousands of strategic actions, TM …

We examine a new class of games, which we call social games, where players not only choose strategies but also choose … players in different roles, among other things. We also examine finite repetitions of games where players may choose to … rematch in any period. Some equilibria of fixed-player repeated games cannot be sustained as equilibria in a repeated social …