Evolution of Mixed Strategies in Monotone Games
From MaRDI portal
Publication:6076868
Abstract: We consider the basic problem of approximating Nash equilibria in noncooperative games. For monotone games, we design continuous time flows which converge in an averaged sense to Nash equilibria. We also study mean field equilibria, which arise in the large player limit of symmetric noncooperative games. In this setting, we will additionally show that the approximation of mean field equilibria is possible under a suitable monotonicity hypothesis.
Recommendations
Cites work
- scientific article; zbMATH DE number 3678487 (Why is no real title available?)
- scientific article; zbMATH DE number 3498726 (Why is no real title available?)
- scientific article; zbMATH DE number 3367692 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- A game-theoretic approach to computation offloading in mobile cloud computing
- A generalization of Brouwer's fixed point theorem
- A note on approximate Nash equilibria
- A variational inequality framework for network games: existence, uniqueness, convergence and sensitivity analysis
- ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces
- An operator splitting approach for distributed generalized Nash equilibria computation
- Continuous-Time Discounted Mirror Descent Dynamics in Monotone Concave Games
- Distributed Generalized Nash Equilibria Computation of Monotone Games via Double-Layer Preconditioned Proximal-Point Algorithms
- Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
- Distributed convergence to Nash equilibria in network and average aggregative games
- Equilibrium points in n -person games
- Fast generalized Nash equilibrium seeking under partial-decision information
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- Mean field games
- Mean field games master equations with nonseparable Hamiltonians and displacement monotonicity
- Mean field games models -- a brief survey
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operator Methods for Nash Equilibria in Non-potential Games
- Non-cooperative games
- Nonlinear semigroups and evolution equations
- Nonlinear semigroups in Hilbert space
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
- Online learning of Nash equilibria in congestion games
- Paths to constrained Nash equilibria
- Probabilistic theory of mean field games with applications I. Mean field FBSDEs, control, and games
- Settling the complexity of computing two-player Nash equilibria
- Solving variational inequalities with stochastic mirror-prox algorithm
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- The Master Equation and the Convergence Problem in Mean Field Games
- The complexity of computing a Nash equilibrium
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
Cited in
(3)
This page was built for publication: Evolution of Mixed Strategies in Monotone Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076868)
