Subgame perfect Nash equilibrium: a learning approach via costs to move

DOI10.1007/s13235-018-0277-3zbMath1429.91015OpenAlexW2883390651MaRDI QIDQ2280200

Maria Carmela Ceparano, Francesco Caruso, Jacqueline Morgan

Publication date: 18 December 2019

Published in: Dynamic Games and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13235-018-0277-3

zbMATH Keywords

noncooperative gameproximal point methodStackelberg gamesubgame perfect Nash equilibriumlearning methodcost to move

Mathematics Subject Classification ID

Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65) Multistage and repeated games (91A20)

Related Items (3)

Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games ⋮ Games and cost of change ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Slightly altruistic equilibria
• Sequential Stackelberg equilibria in two-person games
• On stability of perfect equilibrium points
• Reexamination of the perfectness concept for equilibrium points in extensive games
• On generalized Stackelberg strategies
• Bilevel and multilevel programming: A bibliography review
• An introduction to \(\Gamma\)-convergence
• Stability of regularized bilevel programming problems
• Equilibrium programming using proximal-like algorithms
• Foundations of bilevel programming
• Uniqueness of Nash equilibrium in continuous two-player weighted potential games
• Weak via strong Stackelberg problem: New results
• Topological existence and stability for Stackelberg problems
• Oddness of the number of equilibrium points: a new proof
• Nash equilibrium uniqueness in nice games with isotone best replies
• Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems
• An overview of bilevel optimization
• On the Stackelberg strategy in nonzero-sum games
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Strongly Stable Equilibrium Points of N-Person Noncooperative Games
• Monotone Operators and the Proximal Point Algorithm
• Semivectorial Bilevel Convex Optimal Control Problems: Existence Results
• Necessary optimality conditions in pessimistic bilevel programming
• Pessimistic Bilevel Optimization
• Game Theory
• Proximité et dualité dans un espace hilbertien
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Stackelburg solution for two-person games with biased information patterns
• Convex analysis and monotone operator theory in Hilbert spaces
• Refinements of the Nash equilibrium concept

This page was built for publication: Subgame perfect Nash equilibrium: a learning approach via costs to move