Ioannis Anagnostides

发表

Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, ArXiv.

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Bernhard Haeupler, C. Lenzen, Goran Zuzic, 2021, 2109.05151.

Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games

C. Daskalakis, T. Sandholm, Noah Golowich, 2021, Symposium on the Theory of Computing.

Near-Optimal No-Regret Learning for General Convex Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, ArXiv.

Sampling and Optimal Preference Elicitation in Simple Mechanisms

Dimitris Fotakis, Ioannis Anagnostides, Panagiotis Patsilinakos, 2022, ArXiv.

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games

Ioannis Panageas, Vaggos Chatziafratis, Emmanouil-Vasileios Vlatakis-Gkaragkounis, 2022, ICLR.

Near-Optimal $\Phi$-Regret Learning in Extensive-Form Games

T. Sandholm, Gabriele Farina, Ioannis Anagnostides, 2022, 2208.09747.

Meta-Learning in Games

Zhiwei Steven Wu, M. Khodak, T. Sandholm, 2022, ArXiv.

Near-Optimal No-Regret Learning for General Convex Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, ArXiv.

Dimensionality and Coordination in Voting: The Distortion of STV

Dimitris Fotakis, Ioannis Anagnostides, Panagiotis Patsilinakos, 2022, AAAI.

Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, NeurIPS.

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games

Ioannis Panageas, T. Sandholm, Gabriele Farina, 2022, NeurIPS.

Near-Optimal No-Regret Learning Dynamics for General Convex Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, NeurIPS.

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver

Bernhard Haeupler, C. Lenzen, Goran Zuzic, 2022, PODC.

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games

Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Ioannis Anagnostides, 2023, ArXiv.

Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games

C. Daskalakis, T. Sandholm, Noah Golowich, 2021, STOC.

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games

Ioannis Panageas, T. Sandholm, Gabriele Farina, 2023, 2301.11241.

On Last-Iterate Convergence Beyond Zero-Sum Games

Ioannis Panageas, T. Sandholm, Gabriele Farina, 2022, ICML.

Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis

Ioannis Panageas, Ioannis Anagnostides, Ioannis Panageas, 2021, SOSA.

Metric-Distortion Bounds under Limited Information

Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos, 2021, SAGT.

Asymptotically Optimal Communication in Simple Mechanisms

Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos, 2020, SAGT.

Meta-Learning in Games

Zhiwei Steven Wu, M. Khodak, T. Sandholm, 2022, ICLR.

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games

Ioannis Panageas, T. Sandholm, Gabriele Farina, 2023, ArXiv.

Near-Optimal No-Regret Learning for General Convex Games

Haipeng Luo, T. Sandholm, Christian Kroer, 2022, ArXiv.

A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games pdf

Ioannis Anagnostides, Paolo Penna, P. Penna, 2020, ArXiv.

Solving Zero-Sum Games through Alternating Projections

P. Penna, Ioannis Anagnostides, 2020, ArXiv.

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model pdf

Ioannis Anagnostides, Themis Gouleakis, Themis Gouleakis, 2021, DISC.

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games

Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Ioannis Anagnostides, 2023, EC.

Near-Optimal Φ-Regret Learning in Extensive-Form Games

T. Sandholm, Gabriele Farina, Ioannis Anagnostides, 2022, ICML.

Dimensionality, Coordination, and Robustness in Voting

Dimitris Fotakis, Ioannis Anagnostides, Panagiotis Patsilinakos, 2021, ArXiv.

Accelerated Distributed Laplacian Solvers via Shortcuts pdf

Christoph Lenzen, Themis Gouleakis, Ioannis Anagnostides, 2021, ArXiv.