Skip to main content

07.08.2017

Abstracting Nash equilibria of supermodular games

verfasst von: Francesco Ranzato

Erschienen in: Formal Methods in System Design | Ausgabe 2/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Supermodular games are a well known class of noncooperative games which find significant applications in a variety of models, especially in operations research and economic applications. Supermodular games always have Nash equilibria which are characterized as fixed points of multivalued functions on complete lattices. Abstract interpretation is here applied to set up an approximation framework for Nash equilibria of supermodular games. This is achieved by extending the theory of abstract interpretation in order to cope with approximations of multivalued functions and by providing some methods for abstracting supermodular games, thus obtaining approximate Nash equilibria which are shown to be correct within the abstract interpretation framework.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Birkhoff G (1967) Lattice theory, 3rd edn. AMS, ProvidenceMATH Birkhoff G (1967) Lattice theory, 3rd edn. AMS, ProvidenceMATH
2.
Zurück zum Zitat Carl S, Heikkil S (2011) Fixed point theory in ordered sets and applications. Springer, BerlinCrossRef Carl S, Heikkil S (2011) Fixed point theory in ordered sets and applications. Springer, BerlinCrossRef
3.
Zurück zum Zitat Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixed points. In: Proceedings of 4th ACM symposium on principles of programming languages (POPL’77). ACM Press, pp 238–252 Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixed points. In: Proceedings of 4th ACM symposium on principles of programming languages (POPL’77). ACM Press, pp 238–252
4.
Zurück zum Zitat Cousot P, Cousot R (1979) Systematic design of program analysis frameworks. In: Proceedings 6th ACM symposium on principles of programming languages (POPL’79). ACM Press, pp 269–282 Cousot P, Cousot R (1979) Systematic design of program analysis frameworks. In: Proceedings 6th ACM symposium on principles of programming languages (POPL’79). ACM Press, pp 269–282
5.
7.
Zurück zum Zitat Cousot P, Cousot R (1994) Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages) (Invited Paper). In: Proceedings of the IEEE international conference on computer languages (ICCL’94). IEEE Computer Society Press, pp 95–112 Cousot P, Cousot R (1994) Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages) (Invited Paper). In: Proceedings of the IEEE international conference on computer languages (ICCL’94). IEEE Computer Society Press, pp 95–112
8.
Zurück zum Zitat Daskalakis C, Goldberg PW, Papadimitriou CH (2009) The complexity of computing a Nash equilibrium. SIAM J Comput 39(1):195–259MathSciNetCrossRef Daskalakis C, Goldberg PW, Papadimitriou CH (2009) The complexity of computing a Nash equilibrium. SIAM J Comput 39(1):195–259MathSciNetCrossRef
9.
Zurück zum Zitat Daskalakis C, Mehta A, Papadimitriou CH (2007) Progress in approximate Nash equilibria. In Proceedings of the 8th ACM conference on electronic commerce (EC’07). ACM Press, pp 355–358 Daskalakis C, Mehta A, Papadimitriou CH (2007) Progress in approximate Nash equilibria. In Proceedings of the 8th ACM conference on electronic commerce (EC’07). ACM Press, pp 355–358
10.
11.
Zurück zum Zitat Geser A, Knoop J, Lüttgen G, Steffen B, Rüthing O (1994) Chaotic fixed point iterations. Technical Report MIP-9403, University of Passau, Germany Geser A, Knoop J, Lüttgen G, Steffen B, Rüthing O (1994) Chaotic fixed point iterations. Technical Report MIP-9403, University of Passau, Germany
12.
13.
Zurück zum Zitat Gintis H (2009) Game theory evolving—a problem-centered introduction to modeling strategic interaction, 2nd edn. Princeton University Press, PrincetonMATH Gintis H (2009) Game theory evolving—a problem-centered introduction to modeling strategic interaction, 2nd edn. Princeton University Press, PrincetonMATH
14.
Zurück zum Zitat Hazan E, Krauthgamer R (2011) How hard is it to approximate the best Nash equilibrium? SIAM J Comput 40(1):79–91MathSciNetCrossRef Hazan E, Krauthgamer R (2011) How hard is it to approximate the best Nash equilibrium? SIAM J Comput 40(1):79–91MathSciNetCrossRef
15.
Zurück zum Zitat Miné A (2004) Weakly relational numerical abstract domains. Ph.D. thesis, École Polytechnique, France Miné A (2004) Weakly relational numerical abstract domains. Ph.D. thesis, École Polytechnique, France
16.
Zurück zum Zitat Nielson F, Nielson HR, Hankin C (1999) Principles of program analysis. Springer, BerlinCrossRef Nielson F, Nielson HR, Hankin C (1999) Principles of program analysis. Springer, BerlinCrossRef
18.
Zurück zum Zitat Ranzato F (2015) A new characterization of complete Heyting and co-Heyting algebras. Logical Methods in Computer Science, to appear, 2017 Ranzato F (2015) A new characterization of complete Heyting and co-Heyting algebras. Logical Methods in Computer Science, to appear, 2017
19.
Zurück zum Zitat Ranzato F (2016) Abstract interpretation of supermodular games. In: Proceedings of the 23rd international static analysis symposium (SAS’16), LNCS, vol 9837. Springer, pp 403–423 Ranzato F (2016) Abstract interpretation of supermodular games. In: Proceedings of the 23rd international static analysis symposium (SAS’16), LNCS, vol 9837. Springer, pp 403–423
21.
Zurück zum Zitat Straccia U, Ojeda-Aciego M, Damásio CV (2008) On fixed-points of multivalued functions on complete lattices and their application to generalized logic programs. SIAM J Comput 38(5):1881–1911MathSciNetCrossRef Straccia U, Ojeda-Aciego M, Damásio CV (2008) On fixed-points of multivalued functions on complete lattices and their application to generalized logic programs. SIAM J Comput 38(5):1881–1911MathSciNetCrossRef
23.
Zurück zum Zitat Topkis DM (1998) Supermodularity and complementarity. Princeton University Press, Princeton Topkis DM (1998) Supermodularity and complementarity. Princeton University Press, Princeton
24.
Zurück zum Zitat Veinott AF (1989) Lattice programming. Unpublished notes from lectures at Johns Hopkins University Veinott AF (1989) Lattice programming. Unpublished notes from lectures at Johns Hopkins University
26.
Zurück zum Zitat Zhou L (1994) The set of Nash equilibria of a supermodular game is a complete lattice. Games Econ Behav 7(2):295–300MathSciNetCrossRef Zhou L (1994) The set of Nash equilibria of a supermodular game is a complete lattice. Games Econ Behav 7(2):295–300MathSciNetCrossRef
Metadaten
Titel
Abstracting Nash equilibria of supermodular games
verfasst von
Francesco Ranzato
Publikationsdatum
07.08.2017
Verlag
Springer US
Erschienen in
Formal Methods in System Design / Ausgabe 2/2018
Print ISSN: 0925-9856
Elektronische ISSN: 1572-8102
DOI
https://doi.org/10.1007/s10703-017-0291-x