Convergence method, properties and computational complexity for Lyapunov games

DOI10.2478/V10006-011-0026-XMaRDI QIDQ2845110zbMATH OpenOpenAlexFDO

Authors Julio B. Clempner, Alexander S. Poznyak

Publication date 22 August 2013

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10006-011-0026-x

zbMATH Keywords

repeated gamesbest replyforward decision processLyapunov equilibrium pointLyapunov game

Mathematics Subject Classification ID

Noncooperative games (91A10) Differential games (aspects of game theory) (91A23) Multistage and repeated games (91A20)

Recommendations

• On Lyapunov game theory equilibrium: static and dynamic approaches
• Setting Cournot versus Lyapunov games stability conditions and equilibrium point properties
• scientific article; zbMATH DE number 2188545
• Repeated play of potential games
• On best-response dynamics in potential games

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 5764823 (Why is no real title available?)
• scientific article; zbMATH DE number 49724 (Why is no real title available?)
• A generalization of Brouwer's fixed point theorem
• A note on approximate Nash equilibria
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Dominance solvability and Cournot stability
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Modeling shortest path games with Petri nets: a Lyapunov based theory
• Non-cooperative games
• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• Rationalizable Strategic Behavior
• Rationalizable Strategic Behavior and the Problem of Perfection
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Refinements of the Nash equilibrium concept
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• The complexity of computing a Nash equilibrium
• The complexity of pure Nash equilibria
• The essential John Nash. Edited by Harold W. Kuhn and Sylvia Nasar.

Cited in

(15)

• Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
• On Lyapunov game theory equilibrium: static and dynamic approaches
• Learning Machiavellian strategies for manipulation in Stackelberg security games
• Dr. Alexander Semionovich Poznyak Gorbatch: biography
• Using the extraproximal method for computing the shortest-path mixed Lyapunov equilibrium in Stackelberg security games
• Setting Cournot versus Lyapunov games stability conditions and equilibrium point properties
• Nash equilibrium design and price-based coordination in hierarchical systems
• Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games
• Negotiating transfer pricing using the Nash bargaining solution
• Modeling shortest path games with Petri nets: a Lyapunov based theory
• scientific article; zbMATH DE number 2188545 (Why is no real title available?)
• A Lyapunov approach for stable reinforcement learning
• Computing the strong Nash equilibrium for Markov chains games
• 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

This page was built for publication: Convergence method, properties and computational complexity for Lyapunov games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845110)