Pages that link to "Item:Q2284447"
From MaRDI portal
The following pages link to Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447):
Displaying 14 items.
- Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games (Q747493) (← links)
- Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
- Adapting attackers and defenders patrolling strategies: a reinforcement learning approach for Stackelberg security games (Q1747487) (← links)
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games (Q2031943) (← links)
- Learning Machiavellian strategies for manipulation in Stackelberg security games (Q2122770) (← links)
- Finding the strong Nash equilibrium: computation, existence and characterization for Markov games (Q2198544) (← links)
- Optimal level of transfer pricing for profit sharing: a Lagrange regularized game theory approach (Q2331383) (← links)
- A Tikhonov regularized penalty function approach for solving polylinear programming problems (Q2406305) (← links)
- (Q4504047) (← links)
- Proximal constrained optimization approach with time penalization (Q5059186) (← links)
- A Manipulation Game Based on Machiavellian Strategies (Q5094546) (← links)
- Handling a Kullback--Leibler divergence random walk for scheduling effective patrol strategies in Stackelberg security games (Q5218991) (← links)
- Dr. Alexander Semionovich Poznyak Gorbatch: Biography (Q5377579) (← links)
- Setting Nash Versus Kalai–Smorodinsky Bargaining Approach: Computing the Continuous-Time Controllable Markov Game (Q5377595) (← links)
