We provide an overview and synthesis of the literatures analyzing games in which players are connected via a network structure. We discuss, in particular, the impact of the structure of the network on individuals’ behaviors. We focus on game theoretic modeling, but also include some...

Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess...

Population games describe strategic interactions among large numbers of small, anonymous agents. Behavior in these games is typically modeled dynamically, with agents occasionally receiving opportunities to switch strategies, basing their choices on simple myopic rules called revision protocols....

In this article, we consider how important developments in game theory have contributed to the theory of industrial organization. Our goal is not to survey the theory of industrial organization; rather, we consider the contribution of game theory through a careful discussion of a small number of...

In this survey article, we report results on the existence of pure-strategy Nash equilibria in games with an atomless continuum of players, each with an action set that is not necessarily finite. We also discuss purification and symmetrization of mixed-strategy Nash equilibria, and settings in...

This chapter surveys a class of solution concepts for n-person games without transferable utility -- NTU games for short -- that are based on varying notions of "fair division". An NTU game is a specification of payoffs attainable by members of each coalition through some joint course of action....