Pages that link to "Item:Q2931371"
From MaRDI portal
The following pages link to The complexity of computing a Nash equilibrium (Q2931371):
Displayed 45 items.
- Propositional proofs and reductions between NP search problems (Q435190) (← 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)
- 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)
- An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← 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)
- 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)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Introduction to the special issue on learning and computational game theory (Q2384148) (← links)
- ReGale: some memorable results (Q2389290) (← links)
- Deterministic calibration and Nash equilibrium (Q2462508) (← links)
- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
- Noncooperative cost spanning tree games with budget restrictions (Q3612297) (← links)
- Decision Problems for Nash Equilibria in Stochastic Games (Q3644770) (← links)
- The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
- The Local and Global Price of Anarchy of Graphical Games (Q5459989) (← links)
- Approximate Nash Equilibria for Multi-player Games (Q5459991) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)