Games and cost of change
From MaRDI portal
Publication:2241245
DOI10.1007/s10479-020-03585-wzbMath1480.91087OpenAlexW3013608618MaRDI QIDQ2241245
Publication date: 8 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03585-w
Decision theory (91B06) Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65)
Related Items
On the application of the SCD semismooth* Newton method to variational inequalities of the second kind, Variable sample-size operator extrapolation algorithm for stochastic mixed variational inequalities, On computation of optimal strategies in oligopolistic markets respecting the cost of change
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local search proximal algorithms as decision dynamics with costs to move
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Optimization. Algorithms and consistent approximations
- Equilibrium programming using proximal-like algorithms
- Nash and Walras equilibrium via Brouwer
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Potential games
- Emergence of price-taking behavior
- On computation of optimal strategies in oligopolistic markets respecting the cost of change
- Subgame perfect Nash equilibrium: a learning approach via costs to move
- Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems
- A class of games possessing pure-strategy Nash equilibria
- An iterative method of solving a game
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- Fixed Point Theorems for Mappings Satisfying Inwardness Conditions
- Caristi's fixed point theorem and metric convexity
- Monotone Operators and the Proximal Point Algorithm
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
