On incremental approximate saddle-point computation in zero-sum matrix games
From MaRDI portal
Recommendations
- Iterative computation of security strategies of matrix games with growing action set
- Finding Saddlepoints of Two-Person, Zero Sum Games
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
Cites work
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Adaptive game playing using multiplicative weights
- Linear Programming in O([n3/ln n]L) Operations
- Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Randomized sampling for large zero-sum games
- Research on probabilistic methods for control system design
- Sequential Randomized Algorithms for Robust Convex Optimization
- Simple strategies for large zero-sum games with applications to complexity theory
- The multiplicative weights update method: a meta-algorithm and applications
- Uncertain convex programs: randomized solutions and confidence levels
This page was built for publication: On incremental approximate saddle-point computation in zero-sum matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286267)
