Non-signaling Approximations of Stochastic Team Problems
Naci Saldi, Can Deha Karıksız, Maxim Raginsky, Eric Chitambar
备注:
There is an error in the proof of Theorem 1. In particular, inequality (d) and equalities (b) and (c) at the end of the proof of Theorem 1 are incorrect. As a result, the main result of the paper is incorrect
In this paper, we consider non-signaling approximation of finite stochastic teams. We first introduce a hierarchy of team decision rules that can be classified in an increasing order as randomized policies, quantum-correlated policies, and non-signaling policies. Then, we establish an approximation of team-optimal policies for sequential teams via extendible non-signaling policies. We prove that the distance between extendible non-signaling policies and decentralized policies is small if the extension is sufficiently large. Using this result, we establish a linear programming (LP) approximation of sequential teams. Finally, we state an open problem regarding computation of optimal value of quantum-correlated policies.
Centralized Versus Decentralized Team Games of Distributed Stochastic Differential Decision Systems with Noiseless Information Structures-Part II: Applications
University of Cyprus(塞浦路斯大学);University of Ottawa(渥太华大学)
Cooperative Multi-Agent Assignment over Stochastic Graphs via Constrained Reinforcement Learning
Universidad de la Republica(乌拉圭共和国大学);Univ. of Pittsburgh(匹兹堡大学);Rensselaer Polytechnic Institute(伦斯勒理工学院);Universitat Pompeu Fabra(庞培法布拉大学);Carnegie Mellon University(卡内基梅隆大学)
Real-Time Stochastic Optimal Control for Multi-agent Quadrotor Systems
Universitat Pompeu Fabra(庞培法布拉大学);Radboud University Nijmegen(拉德堡德大学(奈梅亨));University of California Los Angeles(加利福尼亚大学洛杉矶分校);University College London(伦敦大学学院)