Advertisement

On Cooperative Connection Situations Where the Players Are Located at the Edges

  • Stefano Moretti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10767)

Abstract

In classical cooperative connection situations, the agents are located at some nodes of a network and the cost of a coalition is based on the problem of finding a network of minimum cost connecting all the members of the coalition to a source.

In this paper we study a different connection situation with no source and where the agents are the edges, and yet the optimal network associated to each coalition (of edges) is not fixed and follows a cost-optimization procedure. The proposed model shares some similarities with classical minimum cost spanning tree games, but also substantial differences, specifically on the appropriate way to share the costs among the agents located at the edges. We show that the core of these particular cooperative games is always non-empty and some core allocations can be easily computed.

Keywords

Coalitional games Connection situations Cost allocation protocols Core 

References

  1. 1.
    Aziz, H., Lachish, O., Paterson, M., Savani, R.: Wiretapping a hidden network. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 438–446. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-10841-9_40CrossRefGoogle Scholar
  2. 2.
    Bergañtinos, G., Lorenzo, L., Lorenzo-Freire, S.: A generalization of obligation rules for minimum cost spanning tree problems. Eur. J. Oper. Res. 211, 122–129 (2011)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bird, C.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335–350 (1976)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Branzei, R., Moretti, S., Norde, H., Tijs, S.: The P-value for cost sharing in minimum cost spanning tree situations. Theory Decis. 56, 47–61 (2004)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Claus, A., Kleitman, D.J.: Cost allocation for a spanning tree. Networks 3, 289–304 (1973)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Feltkamp, V.: Cooperation in controlled network structures, PhD Dissertation, Tilburg University, The Netherlands (1995)Google Scholar
  7. 7.
    Granot, D., Huberman, G.: On minimum cost spanning tree games. Math. Prog. 21, 1–18 (1981)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hougaard, J.L., Moulin, H.: Sharing the cost of redundant items. Games Econ. Behav. 87, 339–352 (2014)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7, 48–50 (1956)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Moretti, S., Tijs, S., Branzei, R., Norde, H.: Cost allocation protocols for supply contract design in network situations. Math. Meth. Oper. Res. 69(1), 181–202 (2009)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Moulin, H., Laigret, F.: Equal-need sharing of a network under connectivity constraints. Games Econ. Behav. 72(1), 314–320 (2011)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Nagamochi, H., Zeng, D.Z., Kabutoya, N., Ibaraki, T.: Complexity of the minimum base game on matroids. Math. Oper. Res. 22(1), 146–164 (1997)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Norde, H., Moretti, S., Tijs, S.: Minimum cost spanning tree games and population monotonic allocation schemes. Eur. J. Oper. Res. 154(1), 84–97 (2004)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)CrossRefGoogle Scholar
  15. 15.
    Shapley, L.S.: A Value for n-Person Games. In: Kuhn, H.W., Tucker, A.W. (ed.) Contributions to the Theory of Games II, Ann. Math. Studies 28, 307–317, Princeton University Press (1953)Google Scholar
  16. 16.
    Shapley, L.S.: Cores and convex games. Int. J. Game Theory 1, 1–26 (1971)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Sprumont, Y.: Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ. Behav. 2, 378–394 (1990)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Tijs, S., Branzei, R., Moretti, S., Norde, H.: Obligation rules for minimum cost spanning tree situations and their monotonicity properties. Eur. J. Oper. Res. 175, 121–134 (2006)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Université Paris-Dauphine, PSL Research University, CNRS, UMR [7243]ParisFrance

Personalised recommendations