Image de couverture de livre

Tracking solutions of time-varying variational inequalities

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hadiji, Hédi, Sachs, Sarah, Guzmán, Cristóbal
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
par: Dvurechensky, Pavel, et autres
Publié: (2026)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
par: Sachs, Sarah, et autres
Publié: (2023)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
par: Heymann, Benjamin, et autres
Publié: (2024)

The Oracle Complexity of Simplex-based Matrix Games
par: Kornowski, Guy, et autres
Publié: (2024)

Reinforcement Learning for Finite Space Mean-Field Type Games
par: Shao, Kai, et autres
Publié: (2024)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
par: Shen, Lingqing, et autres
Publié: (2024)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
par: Huang, Han, et autres
Publié: (2024)

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
par: Laurière, Mathieu, et autres
Publié: (2024)

Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning
par: Yardim, Batuhan, et autres
Publié: (2024)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
par: Cai, Yang, et autres
Publié: (2024)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
par: Cai, Yang, et autres
Publié: (2024)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
par: Faizal, Fathima Zarin, et autres
Publié: (2024)

MALADY: Multiclass Active Learning with Auction Dynamics on Graphs
par: Bhusal, Gokul, et autres
Publié: (2024)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
par: Cai, Yang, et autres
Publié: (2024)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
par: Emmanouilidis, Konstantinos, et autres
Publié: (2024)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
par: Qiu, Shuang, et autres
Publié: (2022)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
par: Yongacoglu, Bora, et autres
Publié: (2021)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
par: Hu, Ruimeng, et autres
Publié: (2025)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
par: Simchi-Levi, David, et autres
Publié: (2019)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
par: Cai, Yang, et autres
Publié: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
par: Ba, Wenjia, et autres
Publié: (2021)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
par: Graf, Lukas, et autres
Publié: (2021)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
par: Soleymani, Ashkan, et autres
Publié: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
par: Soleymani, Ashkan, et autres
Publié: (2025)

Expected Variational Inequalities
par: Zhang, Brian Hu, et autres
Publié: (2025)

Optimistic Online Learning in Symmetric Cone Games
par: Barakat, Anas, et autres
Publié: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
par: Cai, Yang, et autres
Publié: (2023)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
par: Nayak, Anupam, et autres
Publié: (2025)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
par: Yang, Zongjun, et autres
Publié: (2026)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
par: Sharma, Vedansh
Publié: (2025)

A game-theoretic approach for Generative Adversarial Networks
par: Franci, Barbara, et autres
Publié: (2020)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
par: Ding, Shihong, et autres
Publié: (2023)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
par: Cai, Yang, et autres
Publié: (2025)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
par: Wang, Guillaume, et autres
Publié: (2022)

Online Multi-Agent Control with Adversarial Disturbances
par: Barakat, Anas, et autres
Publié: (2025)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
par: Sakos, Iosif, et autres
Publié: (2023)

Operator Splitting for Learning to Predict Equilibria in Convex Games
par: McKenzie, Daniel, et autres
Publié: (2021)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
par: Jordan, Michael I., et autres
Publié: (2023)