Facets of the Fully Mixed Nash Equilibrium Conjecture

DOI10.1007/978-3-540-79309-0_14zbMath1136.91348OpenAlexW4213329524MaRDI QIDQ5459980

Andreas Pieris, Marios Mavronicolas, Rainer Feldmann

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_14

Mathematics Subject Classification ID

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

Related Items (1)

Nash equilibria in discrete routing games with convex latency functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The price of anarchy for polynomial social cost
• On the structure and complexity of worst-case equilibria
• The price of selfish routing
• Bounds for median and 50 percentage points of binomial and negative binomial distribution
• Selfish routing with incomplete information
• Vergleich der hypergeometrischen mit der Binomial-Verteilung
• Structure and complexity of extreme Nash equilibria
• Non-cooperative games
• A contribution to von Neumann's theory of games
• STACS 2004
• Structural Information and Communication Complexity
• Mathematical Foundations of Computer Science 2003
• Automata, Languages and Programming
• Equilibrium points in n -person games

This page was built for publication: Facets of the Fully Mixed Nash Equilibrium Conjecture