Facets of the Fully Mixed Nash Equilibrium Conjecture

DOI10.1007/978-3-540-79309-0_14zbMATH Open1136.91348OpenAlexW4213329524MaRDI QIDQ5459980FDOQ5459980

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

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
• scientific article; zbMATH DE number 2156279

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
• Title not available (Why is that?)
• Selfish routing with incomplete information
• On the structure and complexity of worst-case equilibria
• Bounds for median and 50 percentage points of binomial and negative binomial distribution
• Structure and complexity of extreme Nash equilibria
• STACS 2004
• Mathematical Foundations of Computer Science 2003
• Automata, Languages and Programming
• Vergleich der hypergeometrischen mit der Binomial-Verteilung
• The price of anarchy for polynomial social cost
• Structural Information and Communication Complexity

Cited In (1)

• Nash equilibria in discrete routing games with convex latency functions

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 Q5459980)