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...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep, ADULYASAK, Yossiri, JAILLET, Patrick |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
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 |
Similar Items
-
An extended study on addressing defender teamwork while accounting for uncertainty in attacker defender games using iterative Dec-MDPs
by: SHIEH, Eric, et al.
Published: (2016) -
Distributed Model Shaping for Scaling to Decentralized POMDPs with hundreds of agents
by: VELAGAPUDI, Prasanna, et al.
Published: (2011) -
Dynamic repositioning to reduce lost demand in Bike Sharing Systems
by: GHOSH, Supriyo, et al.
Published: (2017) -
Decentralized planning in stochastic environments with submodular rewards
by: KUMAR, Rajiv Ranjan, et al.
Published: (2017) -
Prioritized Shaping of Models for Solving DEC-POMDPs
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2012)