Skip to main content
SpringerLink
Log in

An Interval Method for Seeking the Nash Equilibria of Non-cooperative Games

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6068))

Abstract

Computing Nash equilibria in continuous games is a difficult problem. In contrast to discrete games, algorithms developed for continues ones are rather inefficient. This paper proposes a new approach – making use of interval methods we try to solve the problem directly, seeking points that fulfill Nash conditions. We also consider a shared-memory parallelization of the proposed algorithm. Preliminary numerical results are presented. Some new practical aspects of interval methods are considered.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gabay, D., Moulin, H.: On the uniqueness and stability of Nash-equilibria in noncooperative games. In: Bensoussan, A., Kleindorfer, P., Tapiero, C. (eds.) Applied Stochastic Control in Econometrics and Management Science, pp. 271–293. North Holland, Amsterdam (1980)

    Google Scholar 

  2. Hansen, E., Walster, G.E.: Global Optimization Using Interval Analysis, Second edn. Revised and Expanded. Marcel Dekker, New York (2004)

    Google Scholar 

  3. Jauernig, K., Kołodziej, J., Stysło, M.: HGSNash evolutionary strategy as an effective method of detecting the Nash equilibria in n-person non-cooperative games. In: Proceedings of KAEiOG 2006, Murzasichle, pp. 171–178 (2006)

    Google Scholar 

  4. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, London (2001)

    MATH  Google Scholar 

  5. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)

    MATH  Google Scholar 

  6. Kearfott, R.B., Nakao, M.T., Neumaier, A., Rump, S.M., Shary, S.P., van Hentenryck, P.: Standardized notation in interval analysis, http://www.mat.univie.ac.at/~neum/software/int/notation.ps.gz

  7. Kołodziej, J., Jauernig, K., Cieślar, A.: HGSNash strategy as the decision-making method for water resource systems with external disagreement of interests. In: Proceedings of PARELEC 2006, Wrocław, pp. 313–318 (2006)

    Google Scholar 

  8. Kubica, B.J.: Interval methods for solving underdetermined nonlinear equations systems. In: SCAN 2008 Conference, El Paso, Texas (2008)

    Google Scholar 

  9. Kubica, B.J., Woźniak, A.: A multi-threaded interval algorithm for the Pareto-front computation in a multi-core environment. In: PARA 2008 Conference, Trondheim, Norway (2008)

    Google Scholar 

  10. MacKenzie, A.B., Wicker, S.B.: Game theory in communications: Motivation, explanation, and application to power control. In: Proceedings of IEEE GLOBECOM 2001, pp. 821–826 (2001)

    Google Scholar 

  11. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267–275 (1996)

    Google Scholar 

  12. Nash, J.F.: Equilibrium points in n-person games. Proceedings of National Association of Science 36, 48–49 (1950)

    Article  MATH  MathSciNet  Google Scholar 

  13. Neumaier, A.: Interval methods for systems of equations. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  14. Nikaidô, H., Isoda, K.: Note on noncooperative convex games. Pacific Journal of Math. 5(Suppl. I), 807–815 (1955)

    Google Scholar 

  15. Pavlidis, N.G., Parsopoulos, K.E., Vrahatis, M.N.: Computing Nash equilibria through computational intelligence methods. Journal of Computational and Appl. Math. 175, 113–136 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Petrosyan, L.A., Zakharov, V.V.: Introduction to mathematical ecology. Izd. LGU, Leningrad (1986) (in Russian)

    Google Scholar 

  17. Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica 33, 520–534 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  18. Serrano, R.: The theory of implementation of social choice rules. SIAM Review 46, 377–414 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ślepowrońska, K.: A parallel algorithm for finding Nash equilibria (in Polish). Master’s thesis under supervision of A. Woźniak, WUT (1996)

    Google Scholar 

  20. Nash equilibrium, DDWiki article, http://ddl.me.cmu.edu/ddwiki/index.php/Nash_equilibrium#Formal_Description

  21. Interval tree, Wikipedia article, http://en.wikipedia.org/wiki/Interval_tree

  22. C-XSC interval library, http://www.xsc.de

  23. POSIX Threads Programming, https://computing.llnl.gov/tutorials/pthreads

Download references

Author information

Authors and Affiliations

  1. Institute of Control and Computation Engineering, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Bartłomiej Jacek Kubica & Adam Woźniak

Authors
  1. Bartłomiej Jacek Kubica
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Woźniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences,, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland

    Konrad Karczewski

  4. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kubica, B.J., Woźniak, A. (2010). An Interval Method for Seeking the Nash Equilibria of Non-cooperative Games. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14403-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14402-8

  • Online ISBN: 978-3-642-14403-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation