Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 50 matches
- 2024
- 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 - 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 - 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) - 2023
- 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) - Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm:
Meta-Learning in Games. ICLR 2023 - Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Andrew Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR 2023 - Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML 2023: 814-839 - Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS 2023 - Ioannis Anagnostides, Tuomas Sandholm:
On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS 2023 - 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 - Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer:
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. EC 2023: 89 - 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) - 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) - 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) - 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) - Ioannis Anagnostides, Tuomas Sandholm:
On the Interplay between Social Welfare and Tractability of Equilibria. CoRR abs/2310.16976 (2023) - 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) - 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
- Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. J. Artif. Intell. Res. 74: 1449-1483 (2022) - Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Dimensionality and Coordination in Voting: The Distortion of STV. AAAI 2022: 4776-4784 - Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML 2022: 536-581 - 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 - 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 - 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 - Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - 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 - Ioannis Anagnostides, Ioannis Panageas:
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. SOSA 2022: 131-160 - 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 - 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 - 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)
skipping 20 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-08-27 11:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint