Imagen de Portada

On the convergence of fictitious play algorithm in repeated games via the geometrical approach

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wu, Zhouming, Mu, Yifen, Yang, Xiaoguang
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Optimal Pricing Formula for Smart Grid based on Stackelberg Game
por: Cheng, Jiangjiang, et al.
Publicado: (2024)

On finite-horizon approximation of a feedback Nash equilibrium in LQ games
por: Huang, Shengyuan, et al.
Publicado: (2025)

Equilibrium convergence in large games
por: Chen, Enxian, et al.
Publicado: (2020)

Contest for system observability as an infinitely repeated game
por: Xu, Yueyue, et al.
Publicado: (2023)

Last-iterate convergence of modified predictive method via high-resolution differential equation on bilinear game
por: Li, Keke, et al.
Publicado: (2024)

On the sequential convergence of Lloyd's algorithms
por: Portales, Léo, et al.
Publicado: (2024)

Nonconvex optimization and convergence of stochastic gradient descent, and solution of asynchronous game
por: Buck, Kevin, et al.
Publicado: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
por: Rotaru, Teodor, et al.
Publicado: (2024)

On the convergence rate of the Douglas-Rachford splitting algorithm
por: Abbaszadehpeivasti, Hadi, et al.
Publicado: (2025)

Nonconvex weighted variational metal artifacts removal via convergent primal-dual algorithms
por: Wang, Lianfang, et al.
Publicado: (2024)

An error bound-based convergence analysis framework for a class of randomized algorithms
por: Yang, Zhichun, et al.
Publicado: (2026)

An inexact inertial projective splitting algorithm with strong convergence
por: Alves, M. Marques, et al.
Publicado: (2025)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
por: Simon, Emile, et al.
Publicado: (2011)

A differential game approach to intrinsic encirclement control
por: Zhou, Panpan, et al.
Publicado: (2025)

Stable optimisation-based scenario generation via game theoretic approach
por: Bounitsis, Georgios L., et al.
Publicado: (2023)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
por: Prudente, L. F., et al.
Publicado: (2023)

A note on the convergence of RED algorithms under minimal hypotheses and open questions
por: Traonmilin, Yann, et al.
Publicado: (2026)

Why does the two-timescale Q-learning converge to different mean field solutions? A unified convergence analysis
por: An, Jing, et al.
Publicado: (2024)

A condensing approach for linear-quadratic optimization with geometric constraints
por: De Marchi, Alberto
Publicado: (2025)

Two system transformation data-driven algorithms for linear quadratic mean-field games
por: Li, Xun, et al.
Publicado: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
por: Li, Zekai, et al.
Publicado: (2024)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
por: Nishijima, Mitsuhiro, et al.
Publicado: (2025)

Optimal Trajectory Tracking of Nonholonomic Mechanical Systems: a geometric approach
por: Nayak, Aradhana, et al.
Publicado: (2019)

Markov decision processes: on the convergence of the Monte-Carlo first visit algorithm
por: Delattre, Sylvain, et al.
Publicado: (2025)

Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
por: He, X., et al.
Publicado: (2023)

On the convergence of Block Majorization-Minimization algorithms on the Grassmann Manifold
por: Lopez, Carlos Alejandro, et al.
Publicado: (2024)

Distributed online generalized Nash Equilibrium learning in multi-cluster games: A delay-tolerant algorithm
por: Liu, Bingqian, et al.
Publicado: (2024)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
por: Martin, Andrea, et al.
Publicado: (2025)

A consensus-based algorithm for non-convex multiplayer games
por: Chenchene, Enis, et al.
Publicado: (2023)

A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities
por: Alves, M. Marques, et al.
Publicado: (2024)

A geometric integration approach to smooth optimisation: Foundations of the discrete gradient method
por: Ehrhardt, Matthias J., et al.
Publicado: (2018)

Weak and strong convergence of a relaxed inertial proximal splitting algorithm for solving hierarchical equilibrium problems
por: Mazgouri, Zakaria, et al.
Publicado: (2025)

Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses
por: Dzahini, Kwassi Joseph, et al.
Publicado: (2022)

Decentralized online stochastic generalized Nash Equilibrium seeking for multi-cluster games: A Byzantine-resilient algorithm
por: Liu, Bingqian, et al.
Publicado: (2025)

Almost-sharp $O(k^{-1} \log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case
por: Wang, Guillaume
Publicado: (2026)

A system level approach to generalised feedback Nash equilibrium seeking in partially-observed games
por: Neto, Otacilio B. L., et al.
Publicado: (2025)

Local convergence of mean-field Langevin dynamics: from gradient flows to linearly monotone games
por: Wang, Guillaume, et al.
Publicado: (2026)

Full characterization of core for nonlinear optimization games
por: Du, Donglei, et al.
Publicado: (2026)

Distributed equilibrium seeking in aggregative games: linear convergence under singular perturbations lens
por: Carnevale, Guido, et al.
Publicado: (2025)

Robust and structure exploiting optimization algorithms: An integral quadratic constraint approach
por: Michalowsky, Simon, et al.
Publicado: (2019)