Facets of the fully mixed Nash equilibrium conjecture

DOI10.1007/S00224-009-9199-1zbMATH Open1203.91043OpenAlexW2134414177WikidataQ122957590 ScholiaQ122957590MaRDI QIDQ987401FDOQ987401

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

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

zbMATH Keywords

Nash equilibriumsocial cost

Mathematics Subject Classification ID

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

Cites Work

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

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)