Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and sufficient conditions on...

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

We present a general model of two players contest with two types of efforts. Contrary to the classical models of contest, where each player chooses a unique effort, and where the outcome depends on the efforts of all the players, contestants are allowed to reduce the effort of the opponent....

In a society composed of a ruler and its citizens: what are the determinants of the political equilibrium between these two? This paper approaches this problem as a game played between a ruler who has to decide the distribution of the aggregate income and a group of agents/citizens who have the...

We consider a two-stage public goods provision game: In the first stage, players simultaneously decide if they will join a contribution group or not. In the second stage, players in the contribution group simultaneously offer contribution schemes in order to influence the government's choice on...

We examine the formation of networks among a set of players whose payoffs depend on the structure of the network. We focus on games where players may bargain by promising or demanding transfer payments when forming links. We examine several variations of the transfer/bargaining aspect of link...

We define the canonical form of a cost spanning tree problem. The canonical form has the property that reducing the cost of any arc, the minimal cost of connecting agents to the source is also reduced. We argue that the canonical form is a relevant concept in this kind of problems and study a...

Pairwise stability (Jackson and Wolinsky, 1996) is the standard stability concept in network formation. It assumes myopic behavior of the agents in the sense that they do not forecast how others might react to their actions. Assuming that agents are farsighted, related stability concepts have...