Facets of the fully mixed Nash equilibrium conjecture

DOI10.1007/S00224-009-9199-1MaRDI QIDQ987401zbMATH OpenOpenAlexWikidataFDO

Authors Rainer Feldmann, Marios Mavronicolas, Andreas Pieris

Publication date 13 August 2010

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-009-9199-1

zbMATH Keywords

Nash equilibriumsocial cost

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Facets of the Fully Mixed Nash Equilibrium Conjecture
• Mathematical Foundations of Computer Science 2003
• Structure and complexity of extreme Nash equilibria
• Theoretical Computer Science
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A contribution to von Neumann's theory of games
• A new model for selfish routing
• Congestion games with player-specific payoff functions
• Cost sharing mechanisms for fair pricing of resource usage
• Equilibrium points in n -person games
• Mathematical Foundations of Computer Science 2003
• Nash equilibria in discrete routing games with convex latency functions
• Non-cooperative games
• On the structure and complexity of worst-case equilibria
• Selfish routing with incomplete information
• Structural Information and Communication Complexity
• Structure and complexity of extreme Nash equilibria
• The price of selfish routing
• Worst-case equilibria

Cited in

(4)

• Which is the worst-case Nash equilibrium?
• Mathematical Foundations of Computer Science 2003
• A new model for selfish routing
• Facets of the Fully Mixed Nash Equilibrium Conjecture

This page was built for publication: Facets of the fully mixed Nash equilibrium conjecture

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