default search action
Ioannis Anagnostides
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI 2024: 9451-9459 - [c22]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS 2024: 5:1-5:24 - [i28]Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR abs/2402.09670 (2024) - [i27]Ioannis Anagnostides, Tuomas Sandholm:
Convergence of log(1/ε) for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. CoRR abs/2410.21636 (2024) - [i26]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm:
Barriers to Welfare Maximization with No-Regret Learning. CoRR abs/2411.01720 (2024) - [i25]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm:
Computational Lower Bounds for Regret Minimization in Normal-Form Games. CoRR abs/2411.01721 (2024) - 2023
- [j2]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023) - [c21]Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm:
Meta-Learning in Games. ICLR 2023 - [c20]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR 2023 - [c19]Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML 2023: 814-839 - [c18]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS 2023 - [c17]Ioannis Anagnostides, Tuomas Sandholm:
On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS 2023 - [c16]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS 2023 - [c15]Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. EC 2023: 89 - [i24]Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer:
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. CoRR abs/2301.02129 (2023) - [i23]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR abs/2301.11241 (2023) - [i22]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR abs/2306.05216 (2023) - [i21]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Steering No-Regret Learners to Optimal Equilibria. CoRR abs/2306.05221 (2023) - [i20]Ioannis Anagnostides, Tuomas Sandholm:
On the Interplay between Social Welfare and Tractability of Equilibria. CoRR abs/2310.16976 (2023) - [i19]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR abs/2311.14869 (2023) - [i18]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR abs/2312.12067 (2023) - 2022
- [j1]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. J. Artif. Intell. Res. 74: 1449-1483 (2022) - [c14]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Dimensionality and Coordination in Voting: The Distortion of STV. AAAI 2022: 4776-4784 - [c13]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML 2022: 536-581 - [c12]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm:
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. NeurIPS 2022 - [c11]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS 2022 - [c10]Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm:
Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS 2022 - [c9]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - [c8]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm:
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC 2022: 915-916 - [c7]Ioannis Anagnostides, Ioannis Panageas:
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. SOSA 2022: 131-160 - [c6]Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm:
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC 2022: 736-749 - [c5]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC 2022: 6:1-6:20 - [i17]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm:
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR abs/2202.05446 (2022) - [i16]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR abs/2203.12056 (2022) - [i15]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR abs/2203.12074 (2022) - [i14]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm:
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR abs/2204.11417 (2022) - [i13]Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm:
Near-Optimal No-Regret Learning for General Convex Games. CoRR abs/2206.08742 (2022) - [i12]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. CoRR abs/2208.02204 (2022) - [i11]Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR abs/2208.09747 (2022) - [i10]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Sampling and Optimal Preference Elicitation in Simple Mechanisms. CoRR abs/2208.11787 (2022) - [i9]Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm:
Meta-Learning in Games. CoRR abs/2209.14110 (2022) - 2021
- [c4]Ioannis Anagnostides, Themis Gouleakis, Ali Marashian:
Robust Learning under Strong Noise via SQs. AISTATS 2021: 3808-3816 - [c3]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds Under Limited Information. SAGT 2021: 299-313 - [c2]Ioannis Anagnostides, Themis Gouleakis:
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. DISC 2021: 5:1-5:19 - [i8]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. CoRR abs/2107.02489 (2021) - [i7]Ioannis Anagnostides, Themis Gouleakis:
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. CoRR abs/2108.01740 (2021) - [i6]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Dimensionality, Coordination, and Robustness in Voting. CoRR abs/2109.02184 (2021) - [i5]Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen:
Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR abs/2109.05151 (2021) - [i4]Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm:
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR abs/2111.06008 (2021) - 2020
- [c1]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Asymptotically Optimal Communication in Simple Mechanisms. SAGT 2020: 17-31 - [i3]Ioannis Anagnostides, Paolo Penna:
Solving Zero-Sum Games through Alternating Projections. CoRR abs/2010.00109 (2020) - [i2]Ioannis Anagnostides, Paolo Penna:
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR abs/2010.03211 (2020) - [i1]Ioannis Anagnostides, Themis Gouleakis, Ali Marashian:
Robust Learning under Strong Noise via SQs. CoRR abs/2010.09106 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: