Location of Repository

Realizing efficient outcomes in cost spanning problems

By Gustavo Bergantiños and Juan Vidal-Puga


We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions. The equilibrium payoff can them be easily adapted to the framework of Steiner trees.efficiency, cost spanning tree problem, cost allocation, network formation, subgame perfect equilibrium, budget restrictions, Steiner trees

OAI identifier:

Suggested articles



  1. (2004). A non-cooperative approach to the cost spanning tree problem.
  2. (2003). Achieving efficient outcomes in economies with externalities. Fundación Barrié de la Maza. Working paper 61.
  3. (2002). An implementation of the levels structure value.
  4. (2003). An implementation of the Owen value.
  5. (2002). Axiomatization of the Shapley value on minimum cost spanning tree games.
  6. (2001). Bidding for the surplus: A noncooperative approach to the Shapley value.
  7. (2004). Bidding for the surplus: Realizing efficient outcomes in general economic environments.
  8. (2002). Choosing Wisely: A Multibidding Approach.
  9. (2004). Cost monotonicity, consistency and minimum cost spanning tree games.
  10. (2004). Defining rules in cost spanning tree problems through the canonical form.
  11. (1981). M i n i m u mc o s ts p a n n i n gt r e eg a m e s .
  12. (2003). Non-cooperative cost spanning tree games with budget restrictions.M i m e o .
  13. (1984). O nt h ec o r ea n dn u c l e o l u so ft h e minimum cost spanning tree games.
  14. (1976). On cost allocation for a spanning tree: A game theoretic approach.N e t w o r k s6:
  15. (1994). On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Mimeo,
  16. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem.
  17. (1989). Potential, value, and consistency.E c o n o -metrica 57,
  18. (1957). Shortest connection networks and some generalizations.
  19. (1989). The consistent Shapley value for hyperplane games.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.