Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximation
Planning under uncertainty for multiple agents has grown rapidly with the development of formal models such as multi-agent MDPs and decentralized MDPs. But despite their richness, the applicability of these models remains limited due to their computational complexity. We present the class of event-d...
Saved in:
Main Authors: | KUMAR, Akshat, Zilberstein, S. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2211 https://ink.library.smu.edu.sg/context/sis_research/article/3211/viewcontent/Event_Detecting_Multi_Agent_MDPs__Complexity_and_Constant_Factor_Approximation.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
History-Based Controller Design and Optimization for Partially Observable MDPs
by: KUMAR, Akshat, et al.
Published: (2015) -
Dynamic Programming Approximations for Partially Observable Stochastic Games
by: KUMAR, Akshat, et al.
Published: (2009) -
Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
by: KUMAR, Akshat, et al.
Published: (2010) -
Revisiting Risk-Sensitive MDPs: New Algorithms and Results
by: HOU, Ping, et al.
Published: (2014) -
Integrated cooperation and competition in multi-agent decision-making
by: WRAY, Kyle Hollins, et al.
Published: (2018)