Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
From MaRDI portal
Publication:3521959
DOI10.1007/978-3-540-70575-8_57zbMath1153.65337OpenAlexW1493051096MaRDI QIDQ3521959
Javier Esparza, Stefan Kiefer, Thomas Martin Gawlitza, Helmut Seidl
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_57
Numerical computation of solutions to systems of equations (65H10) Stochastic games, stochastic differential games (91A15)
Related Items (6)
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations ⋮ Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games
This page was built for publication: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
