Pages that link to "Item:Q1014631"
From MaRDI portal
The following pages link to Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631):
Displaying 24 items.
- Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Computing Nash equilibria by iterated polymatrix approximation (Q953636) (← 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)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← 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)
- On the exact polynomial time algorithm for a special class of bimatrix game (Q2799636) (← links)
- Convergence method, properties and computational complexity for Lyapunov games (Q2845110) (← links)
- The Cover Number of a Matrix and its Algorithmic Applications (Q2969040) (← links)
- (Q3397628) (← 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)
- LATIN 2004: Theoretical Informatics (Q5901661) (← 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)