scientific article
From MaRDI portal
Publication:3408896
zbMath1098.91004MaRDI QIDQ3408896
Publication date: 6 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) 2-person games (91A05) Methods of reduced gradient type (90C52)
Related Items (19)
Proximal constrained optimization approach with time penalization ⋮ A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies ⋮ Extraproximal approach to calculating equilibriums in pure exchange models ⋮ Multicriteria equilibrium programming: Extraproximal methods ⋮ Inverse complementarity in a resource deficit model ⋮ An extraproximal method for solving equilibrium programming problems in a Hilbert space ⋮ Setting Nash Versus Kalai–Smorodinsky Bargaining Approach: Computing the Continuous-Time Controllable Markov Game ⋮ Computing multiobjective Markov chains handled by the extraproximal method ⋮ 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 ⋮ A Markovian Stackelberg game approach for computing an optimal dynamic mechanism ⋮ Finite number of iterations in the two-step extragradient method ⋮ A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games ⋮ 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 ⋮ Optimal level of transfer pricing for profit sharing: a Lagrange regularized game theory approach ⋮ 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:
