Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximation

• المؤلفون الرئيسيون: KUMAR, Akshat, Zilberstein, S.
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2009
• الموضوعات: Artificial Intelligence and Robotics; Business; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: 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
• المؤسسة: Singapore Management University

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...