If shortest (respectively longest) jobs are served first, splitting a job into smaller jobs (respectively merging several jobs) can reduce the actual wait. Any deterministic protocol is vulnerable to strategic splitting and/or merging. This is not true if scheduling is random, and users care...

A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

Users need to connect a pair of target nodes in the network. They share the fixed connection costs of the edge. The system manager elicits target pairs from users, builds the cheapest forest meeting all demands, and choose a cost sharing rule satisfying:

We ask how to share the cost of finitely many public goods (items) among users with different needs: some smaller subsets of items are enough to serve the needs of each user, yet the cost of all items must be covered, even if this entails inefficiently paying for redundant items. Typical...

Several authors recently proposed an elegant construction to divide the minimal cost of connecting a given set of users to a source. This folk solution applies the Shapley value to the largest reduction of the cost matrix that does not affect the efficient cost. It is also obtained by the linear...

For a convex technology C we characterize cost sharing games where the Nash equilibrium demands maximize total surplus. Budget balance is possible if and only if C is polynomial of degree n-1 or less. For general C, the residual* cost shares are balanced if at least one demand is null, a...