We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...

This paper provides a co-operative as well as a non-cooperative analysis of weighted majority games. The co-operative solution concept introduced here, the Stable Demand Set, yields a meaningful selection within the Mas-Colell Bargaining Set, it contains the Core, it eliminates the "dominated"...

Consider an environment with widespread externalities, and suppose that binding agreements can be written. We study coalition formation in such a setting. Our analysis proceeds by defining on a partition function an extensive form bargaining game. We establish the existence of a stationary...

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...

First, the paper lays out the fun-damental assumptions underlying the game theoretical analysis of international environmental problems. Second it summarises important findings which help to explain the difficulties of co-operation and discusses remedies. Chapter 3 looks at measures to avoid...

We present a simple procedure that selects the strategies most likely to be played by inexperienced agents who interact in one shot 2x2 matching pennies games. As a first step we axiomatically describe players' beliefs. We find the minimax regret criterion to be the simplest functional form that...

We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching...

We study (anti-) coordination problems in networks in a laboratory experiment. Partici- pants interact with their neighbours in a fixed network to play a bilateral (anti-) coordination game. Our main treatment variable is the extent to which players are heterogeneous in the number of connections...

Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...