Subgame perfect Nash equilibrium: a learning approach via costs to move
From MaRDI portal
(Redirected from Publication:2280200)
Recommendations
- Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
- On the generic structure and stability of Stackelberg equilibria
- Subgame perfect equilibria in discounted stochastic games
- Subgame perfect equilibrium in continuous games of perfect information: An elementary approach to existence and approximation by discrete games
- New method to characterize subgame perfect Nash equilibria in differential games
Cites work
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- An introduction to -convergence
- An overview of bilevel optimization
- Bilevel and multilevel programming: A bibliography review
- Convex analysis and monotone operator theory in Hilbert spaces
- Equilibrium programming using proximal-like algorithms
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Foundations of bilevel programming
- Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
- Games and dynamic games
- scientific article; zbMATH DE number 16318 (Why is no real title available?)
- scientific article; zbMATH DE number 125268 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- scientific article; zbMATH DE number 1290200 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- scientific article; zbMATH DE number 3228304 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Inertia and reactivity in decision making as cognitive variational inequalities
- Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems
- Monotone Operators and the Proximal Point Algorithm
- Nash equilibrium uniqueness in nice games with isotone best replies
- Necessary optimality conditions in pessimistic bilevel programming
- Oddness of the number of equilibrium points: a new proof
- On generalized Stackelberg strategies
- On stability of perfect equilibrium points
- On the Stackelberg strategy in nonzero-sum games
- Pessimistic bilevel optimization
- Proximité et dualité dans un espace hilbertien
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refinements of the Nash equilibrium concept
- Semivectorial bilevel convex optimal control problems: Existence results
- Sequential Stackelberg equilibria in two-person games
- Slightly altruistic equilibria
- Stability of regularized bilevel programming problems
- Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
- Stackelburg solution for two-person games with biased information patterns
- Strongly Stable Equilibrium Points of N-Person Noncooperative Games
- Topological existence and stability for Stackelberg problems
- Uniqueness of Nash equilibrium in continuous two-player weighted potential games
- Weak via strong Stackelberg problem: New results
Cited in
(6)- Games and cost of change
- Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games
- Asymptotic behavior of subgame perfect Nash equilibria in Stackelberg games
- On construction of subgame perfect Nash equilibria in Stackelberg games
This page was built for publication: Subgame perfect Nash equilibrium: a learning approach via costs to move
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280200)
