Pages that link to "Item:Q2931371"

The following pages link to The complexity of computing a Nash equilibrium (Q2931371):

Displaying 50 items.

• Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
• \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
• Propositional proofs and reductions between NP search problems (Q435190) (← links)
• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• Equilibria, fixed points, and complexity classes (Q458480) (← links)
• Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
• Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
• Approximate equilibria in strongly symmetric games (Q504398) (← links)
• Action-graph games (Q625044) (← links)
• Equilibria of graphical games with symmetries (Q627165) (← links)
• Local and global price of anarchy of graphical games (Q631783) (← links)
• Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
• Correlated equilibria in continuous games: characterization and computation (Q632966) (← links)
• On the performance of approximate equilibria in congestion games (Q634681) (← links)
• The computational complexity of weak saddles (Q647484) (← links)
• Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
• Load balancing without regret in the bulletin board model (Q661046) (← links)
• A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
• Computing equilibria in discounted dynamic games (Q668745) (← links)
• An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
• Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
• Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
• Ranking games (Q835803) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• The computational complexity of evolutionarily stable strategies (Q926196) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
• Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
• On the complexity of deciding bimatrix games similarity (Q955038) (← links)
• The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
• Well supported approximate equilibria in bimatrix games (Q973002) (← links)
• The computation of approximate competitive equilibrium is PPAD-hard (Q975493) (← links)
• Imitation games and computation (Q993779) (← links)
• The myth of the folk theorem (Q993783) (← links)
• Separable and low-rank continuous games (Q999116) (← links)
• Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
• A note on approximate Nash equilibria (Q1014628) (← links)
• Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
• A simplicial approach for discrete fixed point theorems (Q1014795) (← links)
• Existence of equilibria in a decentralized two-level supply chain (Q1014973) (← links)
• On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
• New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
• Nash equilibria in all-optical networks (Q1043952) (← links)
• Computational complexity in additive hedonic games (Q1046065) (← links)
• Nash and correlated equilibria: Some complexity considerations (Q1191824) (← links)
• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
• Computing pure Nash equilibria in network revenue management games (Q1656431) (← links)
• Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)