The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
A Framework for Sequential Planning in Multi-Agent Settings
Open accessAbstract
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state space. Agents maintain beliefs over physical states of the environment and over models of other agents, and they use Bayesian updates to maintain their beliefs over time. The solutions map belief states to actions. Models of other agents may include their belief states and are related to agent types considered in games of incomplete information. We express the agents' autonomy by postulating that their models are not directly manipulable or observable by other agents. We show that important properties of POMDPs, such as convergence of value iteration, the rate of convergence, and piece-wise linearity and convexity of the value functions carry over to our framework. Our approach complements a more traditional approach to interactive settings which uses Nash equilibria as a solution paradigm. We seek to avoid some of the drawbacks of equilibria which may be non-unique and do not capture off-equilibrium behaviors. We do so at the cost of having to represent, process and continuously revise models of other agents. Since the agent's beliefs may be arbitrarily nested, the optimal solutions to decision making problems are only asymptotically computable. However, approximate belief updates and approximately optimal plans are computable. We illustrate our framework using a simple application domain, and we show examples of belief updates and value functions.
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
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
Game theory: analysis of conflict
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2753 · Cited by 3,325
Recursive Methods in Economic Dynamics
Stokey, N. L., Lucas, R. E., & Prescott, E. C. (1989) · Harvard University Press eBooks · doi:10.2307/j.ctvjnrt76 · Cited by 3,031
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
Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/5803.001.0001 · Cited by 2,610
The Theory of Learning in Games
Drew Fudenberg, B., & Levine, D. K. (1998) · MIT Press Books · Cited by 2,455
Cited by
Reinforcement learning: The Good, The Bad and The Ugly
Dayan, P., & Niv, Y. (2008) · Current Opinion in Neurobiology · doi:10.1016/j.conb.2008.08.003 · Cited by 704
Rational quantitative attribution of beliefs, desires and percepts in human mentalizing
Baker, C. L., Jara-Ettinger, J., Saxe, R., & Tenenbaum, J. B. (2017) · Nature Human Behaviour · doi:10.1038/s41562-017-0064 · Cited by 515
Autonomous agents modelling other agents: A comprehensive survey and open problems
Albrecht, S. V., & Stone, P. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.01.002 · Cited by 417
Radulescu, A., Shin, Y. S., & Niv, Y. (2021) · Annual Review of Neuroscience · doi:10.1146/annurev-neuro-092920-120559 · Cited by 63
Metadata
- Authors
- Gmytrasiewicz, P. J., & Doshi, P.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2005-07-01
- Volume
- 24
- Pages
- 49-79
- ISSN
- 2331-8422 (ISSN-L)
- 1076-9757
- OpenAlex
- W2149551746
- Cited by
- 360
- References
- 41
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Framework for Sequential Planning in Multi-Agent Settings. https://app.cochat.ai/papers/10.1613/jair.1579
- The paper
- Gmytrasiewicz, P. J., & Doshi, P. (2005). A Framework for Sequential Planning in Multi-Agent Settings. Journal of Artificial Intelligence Research. https://doi.org/10.1613/jair.1579
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.