Which is the worst-case Nash equilibrium?

DOI10.1137/22M1542635MaRDI QIDQ6552473zbMATH OpenFDO

Authors Thomas Lücking, Marios Mavronicolas, Burkhard Monien, P. G. Spirakis, Imrich Vrt'o

Publication date 8 June 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1542635

zbMATH Keywords

algorithmic game theoryfully mixed Nash equilibrium conjectureNash equilibrium

Mathematics Subject Classification ID

Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Recommendations

• Mathematical Foundations of Computer Science 2003
• Facets of the Fully Mixed Nash Equilibrium Conjecture
• Theoretical Computer Science
• Structure and complexity of extreme Nash equilibria
• Facets of the fully mixed Nash equilibrium conjecture

Cites work

• A course in game theory.
• A new model for selfish routing
• A Remark on Stirling's Formula
• Approximate equilibria and ball fusion
• Congestion Games with Player-Specific Constants
• Cost sharing mechanisms for fair pricing of resource usage
• Equilibrium points in n -person games
• Facets of the fully mixed Nash equilibrium conjecture
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Nash equilibria in discrete routing games with convex latency functions
• Non-cooperative games
• On the structure and complexity of worst-case equilibria
• Selfish routing in the presence of network uncertainty
• Selfish routing with incomplete information
• Structure and complexity of extreme Nash equilibria
• The price of anarchy for polynomial social cost
• The price of selfish routing
• The structure and complexity of Nash equilibria for a selfish routing game
• Tight bounds for worst-case equilibria
• Worst-case equilibria

This page was built for publication: Which is the worst-case Nash equilibrium?

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