Linear complementarity and P-matrices for stochastic games
From MaRDI portal
Publication:3401964
DOI10.1007/978-3-540-70881-0_35zbMATH Open1185.91039OpenAlexW1557572054MaRDI QIDQ3401964FDOQ3401964
Authors: Ola Svensson, Sergei Vorobyov
Publication date: 2 February 2010
Published in: Perspectives of Systems Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70881-0_35
Recommendations
- Fundamentals of Computation Theory
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games
- Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results
- Pivoting algorithms for some classes of stochastic games: A survey
- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games
Cited In (11)
- Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results
- On solving mean payoff games using pivoting algorithms
- Linear complementarity algorithms for infinite games
- Perturbation theory of completely mixed bimatrix games
- A Note on Linear Complementarity via Two-Person Zero-Sum Games
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games
- Fundamentals of Computation Theory
- Title not available (Why is that?)
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Linear complementarity and P-matrices for stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401964)