The DOI matches its OpenAlex record; 25 of the 25 references it cites were found in a registry or an index.
Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver
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
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132
Dueling Network Architectures for Deep Reinforcement Learning
Wang, Z., Schaul, T., Hessel, M., van Hasselt, H., Lanctot, M., & de Freitas, N. (2015) · arXiv · doi:10.48550/arxiv.1511.06581 · Cited by 3,300
Self-citationBarto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
Markov games as a framework for multi-agent reinforcement learning
Littman, M. L. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50027-1 · Cited by 2,614
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 · cited 2×
“We consider the cooperative multi-agent reinforcement learning (MARL) problem (Panait and Luke, 2005; Busoniu et al., 2008; Tuyls and Weiss, 2012), in which a system of several learning agents must jointly optimize a single reward signal – the team reward – accumulated over time.”
BackgroundPolicy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
Ng, A. Y., Harada, D., & Russell, S. (1999) · Cited by 1,744
Cooperative Multi-Agent Learning: The State of the Art
Panait, L., & Luke, S. (2005) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-005-2631-2 · Cited by 1,237
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 · cited 1×
“Further, in the context of the introduced agent, we evaluate weight sharing, role information and information channels as additional enhancements that have recently been reported to improve sample complexity and memory requirements (Hausknecht, 2016; Foerster et al., 2016; Sukhbaatar et al., 2016).”
BackgroundAlgorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
Nash Q-Learning for General-Sum Stochastic Games
Hu, J., Wellman, M. P., & Boutilier, C. (2003) · Cited by 923
Friend-or-Foe Q-learning in General-Sum Games
Littman, M. L. (2001) · International Conference on Machine Learning · Cited by 427
Coordinated Reinforcement Learning
Guestrin, C., Lagoudakis, M. G., & Parr, R. (2002) · Cited by 323
Multi-agent Reinforcement Learning in Sequential Social Dilemmas
Leibo, J. Z., Zambaldi, V., Lanctot, M., Marecki, J., & Graepel, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.03037 · Cited by 263
Self-citationThe Complexity of Decentralized Control of Markov Decision Processes
Bernstein, D. S., Shlomo Zilberstein, B., & Immerman, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3836 · Cited by 232
Machine learning for combinatorial optimization: A methodological tour d'horizon
Bengio, Y., Lodi, A., & Prouvost, A. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.07.063 · Cited by 195
Multiagent Learning: Basics, Challenges, and Prospects
Tuyls, K., & Weiss, G. (2012) · AI Magazine · doi:10.1609/aimag.v33i3.2426 · Cited by 179
Self-citationSchneider, J., Wong, W.-K., Moore, A., & Riedmiller, M. (2018) · doi:10.1184/r1/6554609 · Cited by 153
Q-decomposition for reinforcement learning agents
Russell, S., & Zimdars, A. L. (2003) · International Conference on Machine Learning · Cited by 146
Potential-based difference rewards for multiagent reinforcement learning
Devlin, S., Yliniemi, L., Kudenko⋆, D., & Tumer, K. (2014) · doi:10.5555/2615731.2615761 · Cited by 87
Tumer, K., & Wolpert, D. H. (2004) · Springer eBooks · doi:10.1007/978-1-4419-8909-3_1 · Cited by 74
Social reward shaping in the prisoner's dilemma
Babes, M., de Cote, E. M., & Littman, M. L. (2008) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/bkbx2867 · Cited by 49
Combining reward shaping and hierarchies for scaling to large multiagent systems
HolmesParker, C., Agogino, A., & Tumer, K. (2016) · The Knowledge Engineering Review · doi:10.1017/s0269888915000156 · Cited by 15
Investigating Recurrence and Eligibility Traces in Deep Q-NetworksPreprint
Harb, J., & Precup, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.05495 · Cited by 13
Cited by
Reinforcement learning algorithms: A brief survey
Shakya, A. K., Pillai, G., & Chakrabarty, S. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120495 · Cited by 656
The StarCraft Multi-Agent Challenge
Samvelyan, M., Rashid, T., Schroeder de Witt, C., Farquhar, G., Nardelli, N., Rudner, T. G. J., Hung, C.-M., Torr, P. H. S., Foerster, J., & Whiteson, S. (2019) · International Joint Conference on Autonomous Agents and Multiagent Systems · doi:10.65109/lvzz5205 · Cited by 453
Toward Autonomous Multi-UAV Wireless Network: A Survey of Reinforcement Learning-Based Approaches
Bai, Y., Zhao, H., Zhang, X., Chang, Z., Jäntti, R., & Yang, K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3323344 · Cited by 295
Du, W., & Ding, S. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09938-y · Cited by 270
Distributed Multi-Agent Meta Learning for Trajectory Design in Wireless Drone Networks
Hu, Y., Chen, M., Saad, W., Poor, H. V., & Cui, S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3088689 · Cited by 152
Metadata
- Authors
- Sunehag, P., Lever, G., Gruslys, A., Czarnecki, W. M., Zambaldi, V., Jaderberg, M., Lanctot, M., Sonnerat, N., Leibo, J. Z., Tuyls, K., & Graepel, T.
- Venue
- arXiv (Cornell University)
- Publisher
- Cornell University
- Published
- 2017-06-16
- ISSN
- 2331-8422 (ISSN-L)
- OpenAlex
- W2626637010
- Cited by
- 491
- References
- 25
- Type
- posted content
- 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.