Pages that link to "Item:Q3574301"

The following pages link to An Optimization Approach for Approximate Nash Equilibria (Q3574301):

Displaying 43 items.

• A Bayesian optimization approach to find Nash equilibria (Q116040) (← links)
• Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
• An alternating direction method for Nash equilibrium of two-person games with alternating offers (Q353164) (← links)
• On the approximation performance of fictitious play in finite games (Q378343) (← 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)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• Approximations of Nash equilibria (Q959971) (← links)
• Well supported approximate equilibria in bimatrix games (Q973002) (← links)
• A note on approximate Nash equilibria (Q1014628) (← links)
• New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
• Unified approach to approximate solutions in games and multiobjective programming (Q1072943) (← links)
• Adjustment process-based approach for computing a Nash-Cournot equilibrium (Q1317090) (← links)
• Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
• Combinatorial optimization in Nash games (Q1802492) (← links)
• Parameterized two-player Nash equilibrium (Q1949741) (← links)
• Lipschitz continuity and approximate equilibria (Q2006946) (← links)
• A globalized Newton method for the computation of normalized Nash equilibria (Q2392752) (← links)
• Methods for computing Nash equilibria of a location-quantity game (Q2482381) (← links)
• On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
• Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
• Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
• Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← 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)
• (Q3501085) (← links)
• Approximating Wardrop Equilibria with Finitely Many Agents (Q3523211) (← links)
• Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
• Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
• (Q4600174) (← links)
• (Q4638112) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
• A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) (← links)
• A Global Optimization Approach to Nonzero Sum Six-Person Game (Q5118431) (← links)
• On oblivious PTAS's for nash equilibrium (Q5172700) (← links)
• A best-response approach for equilibrium selection in two-player generalized Nash equilibrium problems (Q5238197) (← links)
• Approximate Nash Equilibria for Multi-player Games (Q5459991) (← links)
• The Computation of Approximate Generalized Feedback Nash Equilibria (Q5883327) (← links)
• A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
• Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games (Q6488585) (← links)