In this paper we present an axiomatic analysis of several ranking methods for tournaments. We find that two of them exhibit a very good behaviour with respect to the set of properties under consideration. One of them is the maximum likelihood ranking, the most common method in statistics and...

In this paper we consider communication situations in which utility is nontransferable. We compare this model with the more familiar model of transferable utility communication situations and point out an odd feature of the latter. We mainly focus on the inheritance of properties of the...

This paper introduces a new class of transferable-utility games, called multi-issue allocation games.These games arise from various allocation situations and are based on the concepts underlying the bankruptcy model, as introduced by O'Neill (1982).In this model, a perfectly divisible good...

For cooperative games with transferable utility, convexity has turned out to be an important and widely applicable concept.Convexity can be defined in a number of ways, each having its own specific attractions.Basically, these definitions fall into two categories, namely those based on a...

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

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