Some results of Maria Serna on strategic games: complexity of equilibria and models

DOI10.1016/J.COSREV.2020.100346zbMATH Open1486.91015OpenAlexW3113416932MaRDI QIDQ826318FDOQ826318

Authors: Amalia Duch, Carme Àlvarez 

Publication date: 20 December 2021

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2020.100346

Recommendations

• Equilibria problems on games: complexity versus succinctness
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• Symmetries and the complexity of pure Nash equilibrium
• Symmetries and the Complexity of Pure Nash Equilibrium
• The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games

zbMATH Keywords

complexity classesNash equilibriaprice of anarchystrategic gamesbest responsesocial optimum

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Cites Work

• Non-cooperative games
• Algorithmic Game Theory
• A strategic model of social and economic networks
• A class of games possessing pure-strategy Nash equilibria
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New complexity results about Nash equilibria
• The complexity of pure Nash equilibria
• Search games
• Title not available (Why is that?)
• Approximation and Online Algorithms
• Max celebrity games
• The max-distance network creation game on general host graphs
• On the structure of equilibria in basic network formation
• Basic network creation games
• Correction: Basic Network Creation Games
• On a network creation game
• Network Creation Games: Think Global – Act Local
• On dynamics in basic network creation games
• Celebrity games
• The price of anarchy in network creation games
• Title not available (Why is that?)
• The price of selfish behavior in bilateral network formation
• The price of anarchy in cooperative network creation games
• Network formation games with local coalitions
• The complexity of game isomorphism
• The complexity of computing a Nash equilibrium
• Monotone circuits for monotone weighted threshold functions
• The max-distance network creation game on general host graphs
• Computing equilibria in multi-player games
• The Formula Isomorphism Problem
• Network Formation: Bilateral Contracting and Myopic Dynamics
• Network formation for asymmetric players and bilateral contracting
• Title not available (Why is that?)
• Algorithms – ESA 2005
• Title not available (Why is that?)
• On the computational complexity of some classical equivalence relations on boolean functions
• Title not available (Why is that?)
• Equilibria problems on games: complexity versus succinctness
• A note on isomorphism and strategic equivalence of cooperative games
• On the Complexity of Game Isomorphism
• Mathematical Foundations of Computer Science 2005
• Internet and network economics. 4th international workshop, WINE 2008, Shanghai, China, December 17--20, 2008. Proceedings

This page was built for publication: Some results of Maria Serna on strategic games: complexity of equilibria and models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826318)