Cover Image

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kontogiannis, Andreas, Pollatos, Vasilis, Farina, Gabriele, Mertikopoulos, Panayotis, Panageas, Ioannis
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Colonel Blotto with Battlefield Games
by: Afiouni, Salam, et al.
Published: (2025)

Equilibria of the Colonel Blotto Games with Costs
by: Kaźmierowski, Stanisław
Published: (2024)

Stackelberg vs. Nash in the Lottery Colonel Blotto Game
by: Liu, Yan, et al.
Published: (2024)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
by: Dadi, Leello, et al.
Published: (2024)

Polynomial-Time Computation of Exact $Φ$-Equilibria in Polyhedral Games
by: Farina, Gabriele, et al.
Published: (2024)

Characterizing the Convergence of Game Dynamics via Potentialness
by: Bichler, Martin, et al.
Published: (2025)

Cybercrime and Prevention: Colonel Blotto in Social Engineering
by: Benkő, Gergely, et al.
Published: (2026)

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
by: Kalogiannis, Fivos, et al.
Published: (2024)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Blotto on the Ballot: A Ballot Stuffing Blotto Game
by: Shah, Harsh, et al.
Published: (2024)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
by: Barakat, Anas, et al.
Published: (2026)

Move Over, Prisoner's Dilemma: Colonel Blotto has arrived
by: Paarporn, Keith, et al.
Published: (2026)

Inefficient Alliance Formation in Coalitional Blotto Games
by: Shah, Vade, et al.
Published: (2024)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Fast, optimal, and dynamic electoral campaign budgeting by a generalized Colonel Blotto game
by: Valles, Thomas, et al.
Published: (2024)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2024)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Battlefield Transfers in Coalitional Blotto Games
by: Shah, Vade, et al.
Published: (2023)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
by: Patris, Nikolas, et al.
Published: (2024)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
by: Leonardos, Stefanos, et al.
Published: (2021)

Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

Distributed Learning for Dynamic Congestion Games
by: Li, Hongbo, et al.
Published: (2024)

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
by: Feng, Yi, et al.
Published: (2024)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)

Altruism Improves Congestion in Series-Parallel Nonatomic Congestion Games
by: Hill, Colton, et al.
Published: (2024)

Not Yet: Humans Outperform LLMs in a Colonel Blotto Tournament
by: Dagaev, Dmitry, et al.
Published: (2026)

Public Signals in Network Congestion Games
by: Griesbach, Svenja M., et al.
Published: (2022)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

Robust Information Design with Heterogeneous Beliefs in Bayesian Congestion Games
by: Hu, Yuwei, et al.
Published: (2026)

Inequality in Congestion Games with Learning Agents
by: Michailidis, Dimitris, et al.
Published: (2026)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Minimizing Rosenthal's Potential in Monotone Congestion Games
by: Bilò, Vittorio, et al.
Published: (2024)

Cooperate or Compete: Coalition Formation in Congestion Games
by: Sultana, Riya, et al.
Published: (2024)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
by: Fan, Zhiyuan, et al.
Published: (2024)

Human-in-the-loop Learning for Dynamic Congestion Games
by: Li, Hongbo, et al.
Published: (2024)

Hidden-Role Games: Equilibrium Concepts and Computation
by: Carminati, Luca, et al.
Published: (2023)