Pages that link to "Item:Q2845110"
From MaRDI portal
The following pages link to Convergence method, properties and computational complexity for Lyapunov games (Q2845110):
Displaying 13 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)
- Negotiating transfer pricing using the Nash bargaining solution (Q1787057) (← 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)
- Using the extraproximal method for computing the shortest-path mixed Lyapunov equilibrium in Stackelberg security games (Q2229090) (← links)
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
- A Lyapunov approach for stable reinforcement learning (Q2675741) (← links)
- Setting Cournot Versus Lyapunov Games Stability Conditions and Equilibrium Point Properties (Q3459304) (← links)
- On Lyapunov Game Theory Equilibrium: Static and Dynamic Approaches (Q4567819) (← links)
- Dr. Alexander Semionovich Poznyak Gorbatch: Biography (Q5377579) (← links)
- Nash equilibrium design and price-based coordination in hierarchical systems (Q5403407) (← links)
