Accelerated regularized learning in finite N-person games
Fuente:
arXiv
Guardado en:
| Autores principales: | Lotidis, Kyriakos, Giannou, Angeliki, Mertikopoulos, Panayotis, Bambos, Nicholas |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Robust equilibria in continuous games: From strategic to dynamic robustness
por: Lotidis, Kyriakos, et al.
Publicado: (2025)
por: Lotidis, Kyriakos, et al.
Publicado: (2025)
Multi-agent learning under uncertainty: Recurrence vs. concentration
por: Lotidis, Kyriakos, et al.
Publicado: (2025)
por: Lotidis, Kyriakos, et al.
Publicado: (2025)
A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
por: Legacci, Davide, et al.
Publicado: (2024)
por: Legacci, Davide, et al.
Publicado: (2024)
No-regret learning in harmonic games: Extrapolation in the face of conflicting interests
por: Legacci, Davide, et al.
Publicado: (2024)
por: Legacci, Davide, et al.
Publicado: (2024)
Nested replicator dynamics, nested logit choice, and similarity-based learning
por: Mertikopoulos, Panayotis, et al.
Publicado: (2024)
por: Mertikopoulos, Panayotis, et al.
Publicado: (2024)
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
por: Vasconcelos, Francisca, et al.
Publicado: (2023)
por: Vasconcelos, Francisca, et al.
Publicado: (2023)
On the discrete-time origins of the replicator dynamics: From convergence to instability and chaos
por: Falniowski, Fryderyk, et al.
Publicado: (2024)
por: Falniowski, Fryderyk, et al.
Publicado: (2024)
Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
por: Su, Yiheng, et al.
Publicado: (2025)
por: Su, Yiheng, et al.
Publicado: (2025)
The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
por: Azizian, Waïss, et al.
Publicado: (2022)
por: Azizian, Waïss, et al.
Publicado: (2022)
A Parallelizable Approach for Characterizing NE in Zero-Sum Games After a Linear Number of Iterations of Gradient Descent
por: Kim, Taemin, et al.
Publicado: (2025)
por: Kim, Taemin, et al.
Publicado: (2025)
On the equivalence of semidefinite programming and zero-sum semidefinite games
por: Elliott, Jesse, et al.
Publicado: (2026)
por: Elliott, Jesse, et al.
Publicado: (2026)
The impact of uncertainty on regularized learning in games
por: Cauvin, Pierre-Louis, et al.
Publicado: (2025)
por: Cauvin, Pierre-Louis, et al.
Publicado: (2025)
Computing Game Symmetries and Equilibria That Respect Them
por: Tewolde, Emanuel, et al.
Publicado: (2025)
por: Tewolde, Emanuel, et al.
Publicado: (2025)
Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
por: Ito, Shinji, et al.
Publicado: (2026)
por: Ito, Shinji, et al.
Publicado: (2026)
Two-player Domino games
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2023)
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2023)
The Value of Recall in Extensive-Form Games
por: Berker, Ratip Emin, et al.
Publicado: (2024)
por: Berker, Ratip Emin, et al.
Publicado: (2024)
Logit-Q Dynamics for Efficient Learning in Stochastic Teams
por: Donmez, Ahmed Said, et al.
Publicado: (2023)
por: Donmez, Ahmed Said, et al.
Publicado: (2023)
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
por: Tewolde, Emanuel, et al.
Publicado: (2024)
por: Tewolde, Emanuel, et al.
Publicado: (2024)
Semidefinite network games: multiplayer minimax and complementarity problems
por: Ickstadt, Constantin, et al.
Publicado: (2023)
por: Ickstadt, Constantin, et al.
Publicado: (2023)
Tamed Langevin sampling under weaker conditions
por: Lytras, Iosif, et al.
Publicado: (2024)
por: Lytras, Iosif, et al.
Publicado: (2024)
Decision Making under Imperfect Recall: Algorithms and Benchmarks
por: Tewolde, Emanuel, et al.
Publicado: (2026)
por: Tewolde, Emanuel, et al.
Publicado: (2026)
Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
por: Ito, Shinji, et al.
Publicado: (2025)
por: Ito, Shinji, et al.
Publicado: (2025)
The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
por: Azizian, Waïss, et al.
Publicado: (2025)
por: Azizian, Waïss, et al.
Publicado: (2025)
Initialization-driven neural generation and training for high-dimensional optimal control and first-order mean field games
por: Assouli, Mouhcine, et al.
Publicado: (2025)
por: Assouli, Mouhcine, et al.
Publicado: (2025)
Algorithmic Cheap Talk
por: Babichenko, Yakov, et al.
Publicado: (2023)
por: Babichenko, Yakov, et al.
Publicado: (2023)
A Characterization of Complexity in Public Goods Games
por: Gilboa, Matan
Publicado: (2023)
por: Gilboa, Matan
Publicado: (2023)
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
por: Schlotter, Ildikó, et al.
Publicado: (2021)
por: Schlotter, Ildikó, et al.
Publicado: (2021)
Fair Division in a Variable Setting
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)
An Equilibrium Model for Schedule-Based Transit Networks with Hard Vehicle Capacities
por: Harks, Tobias, et al.
Publicado: (2024)
por: Harks, Tobias, et al.
Publicado: (2024)
What is the long-run distribution of stochastic gradient descent? A large deviations analysis
por: Azizian, Waïss, et al.
Publicado: (2024)
por: Azizian, Waïss, et al.
Publicado: (2024)
Improved Approximation Ratio for Strategyproof Facility Location on a Cycle
por: Rogowski, Krzysztof, et al.
Publicado: (2025)
por: Rogowski, Krzysztof, et al.
Publicado: (2025)
TEE-BFT: Pricing the Security of Data Center Execution Assurance
por: Shamis, Alex, et al.
Publicado: (2025)
por: Shamis, Alex, et al.
Publicado: (2025)
EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
por: Bhaskar, Umang, et al.
Publicado: (2024)
por: Bhaskar, Umang, et al.
Publicado: (2024)
Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
por: Jimbo, Takumi, et al.
Publicado: (2026)
por: Jimbo, Takumi, et al.
Publicado: (2026)
On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
por: Yamazaki, Shunta, et al.
Publicado: (2025)
por: Yamazaki, Shunta, et al.
Publicado: (2025)
Carbon Pricing in Traffic Networks
por: Griesbach, Svenja M., et al.
Publicado: (2025)
por: Griesbach, Svenja M., et al.
Publicado: (2025)
A Linear Programming Approach to Estimate the Core in Cooperative Games
por: Camacho, J, et al.
Publicado: (2025)
por: Camacho, J, et al.
Publicado: (2025)
On marginal feature attributions of tree-based models
por: Filom, Khashayar, et al.
Publicado: (2023)
por: Filom, Khashayar, et al.
Publicado: (2023)
Markets are competitive if and only if P != NP
por: Maymin, Philip Z.
Publicado: (2026)
por: Maymin, Philip Z.
Publicado: (2026)
Low communication protocols for fair allocation of indivisible goods
por: Feige, Uriel
Publicado: (2024)
por: Feige, Uriel
Publicado: (2024)
Ejemplares similares
-
Robust equilibria in continuous games: From strategic to dynamic robustness
por: Lotidis, Kyriakos, et al.
Publicado: (2025) -
Multi-agent learning under uncertainty: Recurrence vs. concentration
por: Lotidis, Kyriakos, et al.
Publicado: (2025) -
A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
por: Legacci, Davide, et al.
Publicado: (2024) -
No-regret learning in harmonic games: Extrapolation in the face of conflicting interests
por: Legacci, Davide, et al.
Publicado: (2024) -
Nested replicator dynamics, nested logit choice, and similarity-based learning
por: Mertikopoulos, Panayotis, et al.
Publicado: (2024)