The DOI matches its OpenAlex record.
Convergence and No-Regret in Multiagent Learning
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A Comprehensive Survey of Multiagent Reinforcement Learning
Busoniu, L., Babuska, R., & De Schutter, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.913919 · Cited by 2,235
“An alternative to rationality is the concept of no-regret, which is defined as the requirement that the agent achieves a return that is at least as good as the return of any stationar y strategy, and this holds for any set of strategies of the othe r agents [57].”
BackgroundMethodInfluentialMulti-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Dorri, A., Kanhere, S. S., & Jurdak, R. (2018) · IEEE Access · doi:10.1109/access.2018.2831228 · Cited by 1,043
Multi-agent Reinforcement Learning: An Overview
Buşoniu, L., Babuška, R., & De Schutter, B. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-14435-6_7 · Cited by 741
A survey and critique of multiagent deep reinforcement learning
Hernandez-Leal, P., Kartal, B., & Taylor, M. E. (2019) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-019-09421-1 · Cited by 671
Q-Learning Algorithms: A Comprehensive Classification and Applications
Jang, B., Kim, M., Harerimana, G., & Kim, J. W. (2019) · IEEE Access · doi:10.1109/access.2019.2941229 · Cited by 635
Matignon, L., Laurent, G. J., & Le Fort-Piat, N. (2012) · The Knowledge Engineering Review · doi:10.1017/s0269888912000057 · Cited by 415
If multi-agent learning is the answer, what is the question?
Shoham, Y., Powers, R., & Grenager, T. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2006.02.006 · Cited by 410
Evolutionary Dynamics of Multi-Agent Learning: A Survey
Bloembergen, D., Tuyls, K., Hennes, D., & Kaisers, M. (2015) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4818 · Cited by 295
Multi-agent discrete-time graphical games and reinforcement learning solutions
Abouheaf, M. I., Lewis, F. L., Vamvoudakis, K. G., Haesaert, S., & Babuska, R. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.047 · Cited by 284
Towards Continual Reinforcement Learning: A Review and Perspectives
Khetarpal, K., Riemer, M., Rish, I., & Precup, D. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13673 · Cited by 224
Open Problems in Cooperative AI
Dafoe, A., Hughes, E., Bachrach, Y., Collins, T., McKee, K. R., Leibo, J. Z., Larson, K., & Graepel, T. (2020) · arXiv · doi:10.48550/arxiv.2012.08630 · Cited by 93
Metadata
- Authors
- Bowling, M.
- Published
- 2004-01-01
- Volume
- 17
- Pages
- 209-216
- OpenAlex
- W2138362680
- Cited by
- 207
- References
- 0
- FWCI
- 18.86
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.