On incremental approximate saddle-point computation in zero-sum matrix games
From MaRDI portal
Publication:286267
DOI10.1016/J.AUTOMATICA.2016.02.018zbMATH Open1338.93184OpenAlexW2297836196MaRDI QIDQ286267FDOQ286267
Authors: Shaunak D. Bopardikar, Cédric Langbort 
Publication date: 20 May 2016
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2016.02.018
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
- On randomized fictitious play for approximating saddle points over convex sets
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
Cites Work
- Title not available (Why is that?)
- Uncertain convex programs: randomized solutions and confidence levels
- Adaptive game playing using multiplicative weights
- Research on probabilistic methods for control system design
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Simple strategies for large zero-sum games with applications to complexity theory
- The multiplicative weights update method: a meta-algorithm and applications
- Sequential Randomized Algorithms for Robust Convex Optimization
- Linear Programming in O([n3/ln n]L) Operations
- Title not available (Why is that?)
- Randomized sampling for large zero-sum games
- Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
Cited In (1)
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)
