Decentralized Stochastic Planning with Anonymity in Interactions

Decentralized Stochastic Planning with Anonymity in Interactions

In this paper, we solve cooperative decentralized stochastic planning problems, where the interactions between agents (specified using transition and reward functions) are dependent on the number of agents (and not on the identity of the individual agents) involved in the interaction. A collision of...

Full description

Saved in:
Bibliographic Details
Main Authors: VARAKANTHAM, Pradeep, ADULYASAK, Yossiri, JAILLET, Patrick
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2014
Subjects:
Decentralized Planning with Uncertainty
DEC-MDP
Stochastic Routing
Selfish Routing
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/2221
https://ink.library.smu.edu.sg/context/sis_research/article/3221/viewcontent/8525_38441_1_PB.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/2221
https://ink.library.smu.edu.sg/context/sis_research/article/3221/viewcontent/8525_38441_1_PB.pdf

Similar Items