We study the recursive core introduced in Huang and Sjöström [8]. In general partition function form games, the recursive core coalition structure may be either coarser or finer than the one that maximizes the social surplus. Moreover, the recursive core structure is typically different from...

Game and decision theory start from rather strong premises. Preferences, represented by utilities, beliefs represented by probabilities, common knowledge and symmetric rationality as background assumptions are treated as “given.” A richer language enabling us to capture the process leading...

In two-person generosity games, the proposer’s agreement payoff is exogenously given, whereas that of the responder is endogenously determined by the proposer’s choice of the pie size. In three-person generosity games, equal agreement payoffs for two of the players are either exogenously...

We consider three-sided coalition formation problems when each agent is concerned about his local status as measured by his relative rank position within the group of his own type and about his global status as measured by the weighted sum of the average rankings of the other types of groups. We...

We study the stability of social and economic networks when players are farsighted. We first provide an algorithm that characterizes the unique pairwise and groupwise farsightedly stable set of networks under the componentwise egalitarian allocation rule. We then show that this set coincides...

We introduce a class of evolutionary game dynamics — <em>pairwise comparison dynamics</em> — under which revising agents choose a candidate strategy at random, switching to it with positive probability if and only if its payoff is higher than the agent’s current strategy. We prove that all such...

We study 4 x 4 games for which the best response dynamics contain a cycle. We give examples in which multiple Shapley polygons occur for these kinds of games. We derive conditions under which Shapley polygons exist and conditions for the stability of these polygons. It turns out that there is a...

We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic...

We introduce consistency of beliefs in the space of hierarchies of conditional beliefs (Battigalli and Siniscalchi) and use it to provide epistemic conditions for equilibria in finite multi-stage games with observed actions.

In this note we introduce different levels of decay in the Goyal, Galeotti and Kamphorst (GGK) insider-outsider model of network formation. First, we deal with situations where the amount of decay is sufficiently low to avoid superfluous connections in strict Nash networks and we examine the...