We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on...

We examine a simple bargaining setting, where heterogeneous buyers and sellers are repeatedly matched with each other. We begin by characterizing efficiency in such a dynamic setting, and discuss how it differs from efficiency in a centralized static setting. We then study the allocations which...

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...

Bayesian Statisticians, decision theorists, and game theorists often use Bayesian representations to describe the probability distribution governing the evolution of a stochastic process. Generally, however, one given distribution has infinitely many different Bayesian representations. This...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

I survey the recent literature on the formation of networks. I provide definitions of network games, a number of examples of models from the literature, and discuss some of what is known about the (in)compatibility of overall societal welfare with individual incentives to form and sever links.

We examine a simple economic model of network formation where agents benefit from indirect relationships. We show that small-world features - -- short path lengths between nodes together with highly clustered link structures --- necessarily emerge for a wide set of parameters.

We present a model of network formation where entering nodes find other nodes to link to both completely at random and through search of the neighborhoods of these randomly met nodes. We show that this model exhibits the full spectrum of features that have been found to characterize large...