For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai) is generalized to bargaining problems with non-convex payoff sets. The so-called “efficient proportional solutions”are characterized axiomatically using natural extensions of the...

This paper considers the market for digital music. We claim that the combination of the MP3 format and peer-to-peer networks has made music non-excludable and this feature is essential for the understanding of the economics of the music market. We study optimal business models for selling...

Information goods are essentially public goods as soon as they are made available in digital form on the Internet. Therefore, firms (or providers) of informations goods are forced to consider alternative payment schemes to eliminate the free rider problem. The present paper introduces a...

Within a production theoretic framework, this paper considers an axiomatic approach to benchmark selection. It is shown that two simple and weak axioms: efficiency and comprehensive monotonicity characterize a natural family of benchmarks which typically becomes unique. Further axioms are added...

This paper is concerned with the measurement of intertemporal performance for similar production activities. It abandons the Farrell tradition which relies on efficient production frontiers, instead it focuses on pure dominance relationships among observed activities. The sole assumption on the...

This paper provides an axiomatic characterization of a family of so-called efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin...

In the present paper, the existence of maximal elements for binary relations are studied. Generalized lexicographic relations are introduced, and some results on existence of maximal elements are provided. A simple example shows that economies with "lexicographic consumers" need not have...

We consider a cost sharing problem among agents on a line. The problem is closely related to the classic airport game, but in our model agents are characterized by their location, rather than their needed runway length. We characterize a family of cost allocation rules in which agents pay a...