scientific article; zbMATH DE number 1461223
From MaRDI portal
Publication:4485809
zbMath0960.93001MaRDI QIDQ4485809
Kaddour Najim, E. Gómez-Ramírez, Alexander S. Poznyak
Publication date: 19 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear inequality constraintsadaptive controllearning automatastochastic approximationinfinite horizon optimal controlgradient optimizationcontrolled Markov chaindirect approaches
Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Optimal stochastic control (93E20) Stochastic approximation (62L20) Stochastic learning and adaptive control (93E35)
Related Items (23)
Learning Machiavellian strategies for manipulation in Stackelberg security games ⋮ Optimization problems in chemical reactions using continuous-time Markov chains ⋮ A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies ⋮ Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control ⋮ Computing the strong Nash equilibrium for Markov chains games ⋮ A Tikhonov regularized penalty function approach for solving polylinear programming problems ⋮ Setting Nash Versus Kalai–Smorodinsky Bargaining Approach: Computing the Continuous-Time Controllable Markov Game ⋮ Using the extraproximal method for computing the shortest-path mixed Lyapunov equilibrium in Stackelberg security games ⋮ Adapting attackers and defenders patrolling strategies: a reinforcement learning approach for Stackelberg security games ⋮ Saddle-point calculation for constrained finite Markov chains ⋮ Recursive estimation of high-order Markov chains: approximation by finite mixtures ⋮ Adaptive policy for two finite Markov chains zero-sum stochastic game with unknown transition matrices and average payoffs ⋮ Optimization based on a team of automata with binary outputs ⋮ Observer and control design in partially observable finite Markov chains ⋮ Sparse mean-variance customer Markowitz portfolio optimization for Markov chains: a Tikhonov's regularization penalty approach ⋮ Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness ⋮ Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games ⋮ Handling a Kullback--Leibler divergence random walk for scheduling effective patrol strategies in Stackelberg security games ⋮ Controller exploitation-exploration reinforcement learning architecture for computing near-optimal policies ⋮ Solving the cost to go with time penalization using the Lagrange optimization approach ⋮ Using the Manhattan distance for computing the multiobjective Markov chains problem
This page was built for publication:
