The division of a cake by n players is modeled as a game of timing. We show that such games admit a unique Nash equilibrium.

A basic issue in transboundary fishery management is the new member problem. In this paper we address the problem of allocating the profits between the charter members and the entrants, once the nations concerned have expressed an interest in achieving an agreement.Using game theory we argue...

Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games. Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of...

We study the model of link formation that was introduced by Aumann and Myerson (1988) and focus on symmetric convex games with transferable utilities. We show that with at most five players the full cooperation structure results according to a subgame perfect Nash equilibrium. Moreover, if the...