Open AccessBook Chapter10.1007/978-3-642-30353-1_21

Multiagent decision by partial evaluation

- 28 May 2012

- pp 242-254

TL;DR: It is shown that when agents have private decision variables, the new algorithm can significantly speed up decision in comparison with the earlier CDN algorithm.

Abstract: We consider multiagent cooperative decision in stochastic environments, and focus on online decision during which agents communicate. We generalize partial evaluation from a specific application to a class of collaborative decision networks (CDNs), and propose a distributed decision algorithm based on partial evaluation. We show that when agents have private decision variables, the new algorithm can significantly speed up decision in comparison with the earlier CDN algorithm.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions in "Multiagent decision by partial evaluation" ?

The authors consider multiagent cooperative decision in stochastic environments, and focus on online decision during which agents communicate.. The authors generalize partial evaluation from a specific application to a class of collaborative decision networks ( CDNs ), and propose a distributed decision algorithm based on partial evaluation.. The authors show that when agents have private decision variables, the new algorithm can significantly speed up decision in comparison with the earlier CDN algorithm.

Table 1.Meanµ and standard deviationstd for runtime (in seconds)

Fig. 2. Illustration of correlated cluster

Citations

Journal Article•10.1109/access.2023.3309417

Rational Coordination in Cognitive Agents: A Decision-Theoretic Approach Using ERMM

Noushin Mazhar, +1 more

- IEEE Access

TL;DR: The research aims to provide efficient coordination among cooperative cognitive agents in unpredictable multi-agent situations and significantly lowers the rate of mispredictions about other agents’ actions and takes 30% to 42% less time and 55.4 % fewer moves than RMM.

...read moreread less

References

Journal Article•10.1287/MOOR.27.4.819.297

The Complexity of Decentralized Control of Markov Decision Processes

Daniel S. Bernstein, +3 more

- 01 Nov 2002

- Mathematics of Operations Research

TL;DR: This work considers decentralized control of Markov decision processes and gives complexity bounds on the worst-case running time for algorithms that find optimal solutions and describes generalizations that allow for decentralized control.

...read moreread less

1.1K

•Proceedings Article

The complexity of decentralized control of Markov decision processes

Daniel S. Bernstein, +2 more

- 30 Jun 2000

TL;DR: In this paper, the authors considered the problem of planning for distributed agents with partial state information from a decision-theoretic perspective, and provided mathematical evidence corresponding to the intuition that decentralized planning problems cannot easily be reduced to centralized problems and solved exactly using established techniques.

...read moreread less

•Journal Article•10.1613/JAIR.1024

The communicative multiagent team decision problem: analyzing teamwork theories and models

David V. Pynadath, +1 more

- 01 Jan 2002

- Journal of Artificial Intelligence Resea...

TL;DR: A unified framework for multiagent teamwork, the COMmunicative Multiagent Team Decision Problem (COM-MTDP), which combines and extends existing multiagent theories, and provides a basis for the development of novel team coordination algorithms.

...read moreread less

457

Proceedings Article•10.1145/1082473.1082510

Optimal design in collaborative design network

Yang Xiang, +2 more

- 25 Jul 2005

TL;DR: This work analyzes how choice of agent interface affects the computational complexity of collaborative design and proposes a set of algorithms that allow agents to produce an overall optimal design by autonomous local evaluation of local designs.

...read moreread less

Book Chapter•10.1007/978-3-540-24840-8_25

A Decision-Theoretic Graphical Model for Collaborative Design on Supply Chains

Yang Xiang, +2 more

- 17 May 2004

- Lecture Notes in Computer Science

TL;DR: This work shows that distributed design information from multiple manufacturers and end-users can be represented in a multiply sectioned Bayesian network and places collaborative design in a formal framework so that it can be subject to rigorous algorithmic study.

...read moreread less

Multiagent decision by partial evaluation

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions in "Multiagent decision by partial evaluation" ?

Figures

Citations

Rational Coordination in Cognitive Agents: A Decision-Theoretic Approach Using ERMM

References

The Complexity of Decentralized Control of Markov Decision Processes

The complexity of decentralized control of Markov decision processes

The communicative multiagent team decision problem: analyzing teamwork theories and models

Optimal design in collaborative design network

A Decision-Theoretic Graphical Model for Collaborative Design on Supply Chains

Related Papers (5)

Multiagent Decision Making in Collaborative Decision Networks by Utility Cluster Based Partial Evaluation

Performance models for large scale multiagent systems: using distributed POMDP building blocks

Multiagent planning and learning using random decompositions and adaptive representations

Optimizing information exchange in cooperative multi-agent systems

Task selection problem under uncertainty as decision-making