We consider a connection networks model. Every agent has a demand in the form of pairs of locations she wants connected, and a willingness to pay for connectivity. A planner aims at implementing a welfare maximizing network and allocating the resulting cost, but information is asymmetric: agents...

We consider a generalization of the Minimum Cost Spanning Tree (MCST) model dubbed the Minimum Cost Connection Network (MCCN) model, where network users have connection demands in the form of a pair of target nodes they want connected directly, or indirectly. Given a network which satisfies all...

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

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

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

We consider the problem of distributing the proceeds generated from a joint venture in which the participating agents are hierarchically organized. We characterize a family of allocation rules ranging from the so-called zero-transfer rule (which awards agents in the hierarchy their individually...

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

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