We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue.We assume that the agents collaborate in order to achieve an efficient outcome for society.We allow for side-payments and provide a method for obtaining...

This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced.

In this paper we study cooperative cost games arising from domination problems on graphs.We introduce three games to model the cost allocation problem and we derive a necessary and su cient condition for the balancedness of all three games.Furthermore we study concavity of these games.

In this paper we characterize the class of games for which the core coincides with the core cover (compromise stable games).Moreover we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems.Also the class of convex...

In a three player dynamic public goods experiment, social output today determines production possibilities tomorrow.In each period, players choose to sabotage, to co-operate, or to play best response.Sabotage harms social output and growth.Mutual co-operation maximises both.The property rights...

In an experimental study we examine a variant of the 'minimum effort game', a coordination game with Pareto ranked equilibria, and risk considerations pointing to the least efficient equilibrium.We focus on the question whether simple cues such as smiles, winks and handshakes could be recognized...

In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of...

Abstract: Lindelauf et al. (2009a) introduced a quantitative approach to investigate optimal structures of covert networks. This approach used an objective function which is based on the secrecy versus information trade-off these organizations face. Sageman (2008) hypothesized that covert...

Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper...