Pages that link to "Item:Q1014631"

The following pages link to Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631):

Displaying 14 items.

• Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← 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)
• On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
• Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces (Q2671752) (← links)
• Convergence method, properties and computational complexity for Lyapunov games (Q2845110) (← 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)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← 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)