3 citations · 3 across the 8 of their papers we have counts for
3 papers · 1 filter
The Complexity of Computing Nash Equilibria in Colonel Blotto Games
Vasilis Pollatos, Andreas Kontogiannis
We study the complexity of Nash equilibrium computation in discrete Colonel Blotto games. For two-player general-sum Colonel Blotto with monotonic piecewise-constant battlefield pa…
The Complexity of Computing Coarse Correlated Equilibria in Markov Games with a Single Controller
Gabriele Farina, Andreas Kontogiannis, Ioannis Panageas +1
We study the complexity of computing stationary Markov coarse correlated equilibria (CCE) in discounted single-controller stochastic (Markov) games [PR81, FV97], a fundamental subc…
Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
Andreas Kontogiannis, Vasilis Pollatos, Gabriele Farina +2
We examine the problem of efficiently learning coarse correlated equilibria (CCE) in polyhedral games, that is, normal-form games with an exponentially large number of actions per…