The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Multi-agent reinforcement learning as a rehearsal for decentralized planning
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
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
Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
Ng, A. Y., Harada, D., & Russell, S. (1999) · Cited by 1,744
Reinforcement Learning: An Introduction
(1998) · Kybernetes · doi:10.1108/k.1998.27.9.1093.3 · Cited by 1,472
Using confidence bounds for exploitation-exploration trade-offs
Auer, P. L. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944941 · Cited by 1,229
The Complexity of Decentralized Control of Markov Decision Processes
Bernstein, D. S., Givan, R., Immerman, N., & Zilberstein, S. (2002) · Mathematics of Operations Research · doi:10.1287/moor.27.4.819.297 · Cited by 1,192
Reinforcement Learning in the Multi-Robot Domain
Matarić, M. J. (1997) · Autonomous Robots · doi:10.1023/a:1008819414322 · Cited by 408
Planning, Learning and Coordination in Multiagent Decision Processes
Boutilier, C. E. (1996) · Cited by 392
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Oliehoek, F. A., Spaan, M. T. J., & Vlassis, N. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2447 · Cited by 265
Accelerating Reinforcement Learning through Implicit Imitation
Price, B., & Boutilier, C. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.898 · Cited by 178
Combining manual feedback with subsequent MDP reward signals for reinforcement learning
Knox, W. B., & Stone, P. (2010) · doi:10.5555/1838206.1838208 · Cited by 175
Memory-bounded dynamic programming for DEC-POMDPs
Seuken, S., & Zilberstein, S. (2007) · Cited by 132
General game learning using knowledge transfer
Banerjee, B., & Stone, P. (2007) · Cited by 103
Self-citationCoordinated Multi-Agent Reinforcement Learning in Networked Distributed POMDPs
Zhang, C., & Lesser, V. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7886 · Cited by 98
Value-function-based transfer for reinforcement learning using structure mapping
Liu, Y., & Stone, P. (2006) · Cited by 70
Point-based dynamic programming for DEC-POMDPs
Szer, D., & Charpillet, F. (2006) · Cited by 57
Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion
Spaan, M. T. J., Oliehoek, F. A., & Amato, C. (2011) · doi:10.5591/978-1-57735-516-8/ijcai11-338 · Cited by 43
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Dibangoye, J., Mouaddib, A., & Chai-draa, B. (2009) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/yget7348 · Cited by 39
Lossless clustering of histories in decentralized POMDPs
Oliehoek, F. A., Whiteson, S., & Spaan, M. T. J. (2009) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/qusu6255 · Cited by 34
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Aras, R., & Dutech, A. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2915 · Cited by 30
Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs
Banerjee, B., Lyle, J., Kraemer, L., & Yellamraju, R. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8260 · Cited by 26
Self-citationRollout Sampling Policy Iteration for Decentralized POMDPsPreprint
Wu, F., Zilberstein, S., & Chen, X. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.3528 · Cited by 23
Q-value Heuristics for Approximate Solutions of Dec-POMDPs
Oliehoek, F. A., & Vlassis, N. A. (2007) · UvA-DARE (University of Amsterdam) · Cited by 5
Kraemer, L., & Banerjee, B. (2013) · Cited by 3
Self-citationConcurrent reinforcement learning as a rehearsal for decentralized planning under uncertainty
Kraemer, L., & Banerjee, B. (2013) · Aquila Digital Community (University of Southern Mississippi) · doi:10.5555/2484920.2485188 · Cited by 2
Self-citation
Cited by
Counterfactual Multi-Agent Policy Gradients
Foerster, J., Farquhar, G., Afouras, T., Nardelli, N., & Whiteson, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11794 · Cited by 1,873
Nguyen, T. T., Nguyen, N. D., & Nahavandi, S. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977374 · Cited by 1,306
Multi-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
Learning to Communicate with Deep Multi-Agent Reinforcement Learning
Foerster, J. N., Assael, Y. M., de Freitas, N., & Whiteson, S. (2016) · arXiv · doi:10.48550/arxiv.1605.06676 · Cited by 1,217
Multi-agent deep reinforcement learning: a survey
Gronauer, S., & Diepold, K. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-09996-w · Cited by 957
Metadata
- Authors
- Kraemer, L., & Banerjee, B.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2016-05
- Volume
- 190
- Pages
- 82-94
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2292533394
- Cited by
- 343
- References
- 26
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- bronze
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.