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

In the present paper a generalization of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems is provided. The generalization is obtained by a slight weakening of the axioms used in Kalai-Smorodinsky (1975) and Roth (1980).