Automating approximation analysis for Nash equilibria algorithms in two-player games
From MaRDI portal
Cites work
- A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
- A survey on algorithms for Nash equilibria in finite normal-form games
- AdWords and generalized online matching
- Algorithmic Game Theory
- Analysing the complexity of functional programs: higher-order meets first-order
- Automated tail bound analysis for probabilistic recurrence relations
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Distributed Methods for Computing Approximate Equilibria
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- Non-cooperative games
- On computable numbers, with an application to the Entscheidungsproblem.
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of the parity argument and other inefficient proofs of existence
- On the inference of resource usage upper and lower bounds
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium
- On total functions, existence theorems and computational complexity
- Rational verification for Nash and subgame-perfect equilibria in graph games
- Settling the complexity of computing approximate two-player Nash equilibria
- Settling the complexity of computing two-player Nash equilibria
- The complexity of computing a Nash equilibrium
- Verifying time complexity of Turing machines
This page was built for publication: Automating approximation analysis for Nash equilibria algorithms in two-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884308)
