The following pages link to Rahul Savani (Q329274):
Displaying 34 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Computing constrained approximate equilibria in polymatrix games (Q681849) (← links)
- Space debris removal: a game theoretic analysis (Q725025) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Unique end of potential line (Q2194856) (← links)
- Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
- Computing Approximate Nash Equilibria in Polymatrix Games (Q2936976) (← links)
- Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 (Q2937742) (← links)
- The Complexity of the Simplex Method (Q2941508) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- Computing Stable Outcomes in Hedonic Games (Q3162517) (← links)
- Linear Complementarity Algorithms for Infinite Games (Q3401105) (← links)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443) (← links)
- Power Indices in Spanning Connectivity Games (Q3638444) (← links)
- (Q4553289) (← links)
- The Complexity of All-switches Strategy Improvement (Q4575585) (← links)
- Unit vector games (Q4584800) (← links)
- (Q4989405) (← links)
- Reachability Switching Games (Q5002810) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- Hedonic Games (Q5133018) (← links)
- One-Clock Priced Timed Games are PSPACE-hard (Q5145650) (← links)
- Hard-to-Solve Bimatrix Games (Q5489083) (← links)
- The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions (Q5495006) (← links)
- (Q5744805) (← links)
- (Q6187016) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
