The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models
Open accessAbstract
Despite the significant progress in multiagent teamwork, existing research does not address the optimality of its prescriptions nor the complexity of the teamwork problem. Without a characterization of the optimality-complexity tradeoffs, it is impossible to determine whether the assumptions and approximations made by a particular theory gain enough efficiency to justify the losses in overall performance. To provide a tool for use by multiagent researchers in evaluating this tradeoff, we present a unified framework, the COMmunicative Multiagent Team Decision Problem (COM-MTDP). The COM-MTDP model combines and extends existing multiagent theories, such as decentralized partially observable Markov decision processes and economic team theory. In addition to their generality of representation, COM-MTDPs also support the analysis of both the optimality of team performance and the computational complexity of the agents' decision problem. In analyzing complexity, we present a breakdown of the computational complexity of constructing optimal teams under various classes of problem domains, along the dimensions of observability and communication cost. In analyzing optimality, we exploit the COM-MTDP's ability to encode existing teamwork theories and models to encode two instantiations of joint intentions theory taken from the literature. Furthermore, the COM-MTDP model provides a basis for the development of novel team coordination algorithms. We derive a domain-independent criterion for optimal communication and provide a comparative analysis of the two joint intentions instantiations with respect to this optimal policy. We have implemented a reusable, domain-independent software package based on COM-MTDPs to analyze teamwork coordination strategies, and we demonstrate its use by encoding and evaluating the two joint intentions strategies within an example domain.
Overview
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
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
Smallwood, R. D., & Sondik, E. J. (1973) · Operations Research · doi:10.1287/opre.21.5.1071 · Cited by 1,479
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Collaborative plans for complex group action
Grosz, B. J., & Kraus, S. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00103-4 · Cited by 954
Tambe, M. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.433 · Cited by 897
Self-citationControlling cooperative problem solving in industrial multi-agent systems using joint intentions
Jennings, N. R. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00020-2 · Cited by 549
Grosz, B. J., & Sidner, C. L. (1990) · Intentions in Communication · doi:10.7551/mitpress/3839.003.0022 · Cited by 510
Levesque, H. J., Cohen, P. R., & Nunes, J. H. T. (1990) · National Conference on Artificial Intelligence · Cited by 456
Planning, Learning and Coordination in Multiagent Decision Processes
Boutilier, C. E. (1996) · Cited by 392
Team decision theory and information structures
Ho, Y.-C. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11718 · Cited by 343
Designing a family of coordination algorithms
Decker, K., & Lesser, V. (1997) · Cited by 286
Partial global planning: a coordination framework for distributed hypothesis formation
Durfee, E. H., & Lesser, V. R. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.120067 · Cited by 271
The 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
Learning to Cooperate via Policy Search
Peshkin, L., Kim, K.-E., Meuleau, N., & Kaelbling, L. P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.1484 · Cited by 217
Communication decisions in multi-agent cooperation: model and experiments
Xuan, P., Lesser, V., & Zilberstein, S. (2001) · Proceedings of the fifth international conference on Autonomous agents · doi:10.1145/375735.376469 · Cited by 204
CAST: collaborative agents for simulating teamwork
Yen, J., Yin, J., Ioerger, T. R., Miller, M. S., Xu, D., & Volz, R. A. (2001) · Cited by 152
COLLAGEN: when agents collaborate with people
Rich, C., & Sidner, C. L. (1997) · doi:10.1145/267658.267730 · Cited by 151
Interference as a tool for designing and evaluating multi-robot controllers
Goldberg, D., & Matarić, M. J. (1997) · Cited by 136
An Automated Teamwork Infrastructure for Heterogeneous Software Agents and Humans
Pynadath, D. V., & Tambe, M. (2003) · Autonomous Agents and Multi-Agent Systems · doi:10.1023/a:1024176820874 · Cited by 123
Self-citationKinny, D., Sonenberg, E., Ljungberg, M., Tidhar, G. A., Rao, A., & Werner, E. N. (1994) · Cited by 77
Toward a semantics for an agent communications language based on speech0-acts
Smith, I., & Cohen, P. R. (1996) · Cited by 61
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
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 of multi-agent organizational paradigms
HORLING, B., & LESSER, V. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888905000317 · Cited by 709
A survey of inverse reinforcement learning: Challenges, methods and progress
Arora, S., & Doshi, P. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2021.103500 · Cited by 610
Multirobot Systems: A Classification Focused on Coordination
Farinelli, A., Iocchi, L., & Nardi, D. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2004.832155 · Cited by 367
Metadata
- Authors
- Pynadath, D. V., & Tambe, M.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2002-06-01
- Volume
- 16
- Pages
- 389-423
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W1536258751
- Cited by
- 376
- References
- 21
- FWCI
- 20.07
- Type
- journal article
- Language
- en
- Open access
- diamond
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.