Skip to main content
SpringerLink
Log in
Book cover

Contributions in Mathematics and Engineering pp 81–93Cite as

A Network Design Model Under Uncertainty

  • Chapter
  • First Online:

Abstract

In this paper we present a cooperative game theoretical model for the well-known problem of network design. There is a multi-commodity network flow problem for each subset of players, who optimize the design of the network. Each player receives a return for shipping his commodity, and we consider the possibility to have uncertainty in this return. A cooperative game under interval uncertainty is presented for the model, and the existence of core solutions and approximate core solutions is investigated.

In Honor of Constantin Carathéodory

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Alparslan Gök, S.Z., Branzei, R., Tijs, S.: Convex interval games. J. Appl. Math. Decis. Sci. 2009, 1–14 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alparslan Gök, S.Z., Branzei, R., Tijs, S.: Airport interval games and their Shapley value. Oper. Res. Dec. 2, 571–575 (2009)

    MATH  Google Scholar 

  3. Alparslan Gök, S.Z., Miquel, S., Tijs, S.: Cooperation under interval uncertainty. Math. Meth. Oper. Res. 69, 99–109 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Avrachenkov, K., Elias, J., Martignon, F., Neglia, G., Petrosyan, L.: A Nash bargaining solution for cooperative network formation games. In: Proceedings of Networking 2011, Valencia, 9–13 May (2011)

    Google Scholar 

  5. Branzei, R., Tijs, S., Alparslan Gök, S.Z.: Somev characterizations of convex interval games. 2 (3), 219–226 (2008)

    Google Scholar 

  6. Branzei, R., Branzei, O., Alparslan Gök, S.Z., Tijs, S.: Cooperative interval games: a survey. Central Eur. J. Oper. Res. 18 (3), 397–411 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Branzei, R., Mallozzi, L., Tijs, S.: Peer group situations and games with interval uncertainty. Int. J. Math. Game Theory Algebra 19 (5–6), 381–388 (2010)

    MathSciNet  MATH  Google Scholar 

  8. Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: SODA ’08/SICOMP ’10 (2008)

    Google Scholar 

  9. D’Amato, E., Daniele, E., Mallozzi, L., Petrone, G.: Equilibrium strategies via GA to Stackelberg games under multiple follower best reply. Int. J. Intell. Syst. 27, 74–85 (2012)

    Article  Google Scholar 

  10. D’Amato, E., Daniele, E., Mallozzi, L., Petrone, G., Tancredi, S.: A hierarchical multi-modal hybrid Stackelberg-Nash GA for a leader with multiple followers game. In: Sorokin, A., Murphey, R., Thai, M.T., Pardalos, P.M, (eds.) Dynamics of Information Systems: Mathematical Foundations. Springer Proceedings in Mathematics & Statistics, vol. 20, pp. 267–280. Springer, Berlin (2012)

    Google Scholar 

  11. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344, 243–278 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discret. Appl. Math. 58, 13–17 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gilles, R.P., Chakrabarti, S., Sarangi, S.: Nash equilibria of network formation games under consent. Math. Soc. Sci. 64, 159–165 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Liu, X., Zhang, M., Zang, Z.: On interval assignment games. In: Zang, D. (ed.) Advances in Control and Communication. Lecture Notes in Electrical Engineering, vol. 137, pp. 611–616. Springer, Berlin (2012)

    Google Scholar 

  15. Mallozzi, L.: An application of optimization theory to the study of equilibria for games: a survey. Central Eur. J. Oper. Res. 21 (3), 523–539 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Marinakis, Y., Migdalas, A., Pardalos, P.M.: Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem. Optim. Lett. 2, 351–361 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124–143 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Moore, R.: Methods and Applications of Interval Analysis. SIAM Studies in Applied Mathematics. SIAM, Philadelphia (1995)

    Google Scholar 

  19. Moulin, H.: Game Theory for the Social Sciences, 2nd and revised edn. New York University Press, New York (1986)

    Google Scholar 

  20. Neumann, F., Witt, C.: Ant colony optimization and the minimum spanning tree problem. Theor. Comput. Sci. 411, 2406–2413 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  21. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  MATH  Google Scholar 

  22. Owen, G.: Game Theory. Academic, UK (1995)

    MATH  Google Scholar 

  23. Sharkey, W.W.: Network Models in Economics, Chap 9. In: Ball, M.O., et al. (eds.) Handbooks in OR & MS, vol. 8, Elsevier, Amsterdam (1995)

    Google Scholar 

  24. Tijs, S.: Introduction to Game Theory. Hindustan Book Agency, New Delhi (2003).

    MATH  Google Scholar 

  25. Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton NJ (1998)

    Google Scholar 

Download references

Acknowledgements

This work has been supported by Gruppo Nazionale per l’Analisi Matematica, la Probabilità e loro Applicazioni (GNAMPA), Project 2015: Disequazioni Variazionali e Applicazioni a Problemi Economici.

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Industriale e dell’Informazione, Seconda Università degli Studi di Napoli, Via Roma 29, 80039, Aversa, Italy

    E. D’Amato

  2. Fraunhofer Institut für Windenergie und Energiesystemtechnik - IWES, Ammerländer Heerstraße 136, 26129, Oldenburg, Germany

    E. Daniele

  3. Departments of Mathematics and Applications “R. Caccioppoli”, Università degli Studi di Napoli “Federico II”, Via Claudio 21, 80125, Napoli, Italy

    L. Mallozzi

Authors
  1. E. D’Amato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Daniele
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Mallozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Mallozzi .

Editor information

Editors and Affiliations

  1. Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Mathematics, National Technical Unversity of Athens Department of Mathematics, Athens, Greece

    Themistocles M. Rassias

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

D’Amato, E., Daniele, E., Mallozzi, L. (2016). A Network Design Model Under Uncertainty. In: Pardalos, P., Rassias, T. (eds) Contributions in Mathematics and Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-31317-7_5

Download citation

Publish with us

Policies and ethics

Search

Navigation