Pages that link to "Item:Q1014628"
From MaRDI portal
The following pages link to A note on approximate Nash equilibria (Q1014628):
Displaying 38 items.
- Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- Domination in 3-tournaments (Q346441) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Approximations of Nash equilibria (Q959971) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- An early paper on the refinement of Nash equilibrium (Q1913576) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Approximate solutions and Tikhonov well-posedness for Nash equilibria (Q2771638) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- Convergence method, properties and computational complexity for Lyapunov games (Q2845110) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Incentive-Compatible Learning of Reserve Prices for Repeated Auctions (Q4994171) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Approximate Nash Equilibria for Multi-player Games (Q5459991) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Evolution of Mixed Strategies in Monotone Games (Q6076868) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)