Security in multiagent systems by policy randomization

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 273-280

  Paruchuri, Praveen ^a   Tambe, Milind ^a   Ordóñez, Fernando ^a   Kraus, Sarit ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Decentralized POMDP; MDP; POMDP; Safety and security in agent systems; Teamwork

Indexed keywords

POLICY RANDOMIZATION; ROLLING DOWN RANDOMIZATION (RDR); SAFETY AND SECURITY IN AGENT SYSTEMS;

ALGORITHMS; COMPUTER CRIME; ELECTRONIC CRIME COUNTERMEASURES; LINEAR PROGRAMMING; MULTI AGENT SYSTEMS; NONLINEAR PROGRAMMING;

SECURITY OF DATA;

EID: 34247243309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160681     Document Type: Conference Paper

References (16)

1. E. Altman. Constrained Markov Decision Process. Chapman and Hall, 1999.
2. R. Beard and T. McLain. Multiple uav cooperative search under collision avoidance and limited range communication constraints. In IEEE CDC, 2003.
3. D. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of MDPs. In UAI, 2000.
4. D. Dolgov and E. Durfee. Constructing optimal policies for agents with constrained architectures. Technical report, Univ of Michigan, CSE-TR-476-03, 2003.
5. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, 2004.
6. E. Hansen, D. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In AAAI, 2004.
7. J. Hu and P. Wellman. Multiagent reinforcement learning: theoretical framework and an algorithm. In ICML, 1998.
8. D. A. Huffman. A method for the construction of minimum redundancy codes. In Proc. IRE 40, 1952.
9. T. Jaakkola, S. Singh, and M. Jordan. Reinforcement learning algorithm for partially observable markov decision problems. Advances in NIPS, 7, 1994.
10. M. Littman. Markov games as a framework for multi-agent reinforcement learning. In ML, 1994.
11. R. Nair, D. Pynadath, M. Yokoo, M. Tambe, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI, 2003.
12. S. Paquet, L. Tobin, and B. Chaib-draa. An online POMDP algorithm for complex multiagent environments. In AAMAS, 2005.
13. P. Paruchuri, M. Tambe, F. Ordonez, and S. Kraus. Towards a formalization of teamwork with resource constraints. In AAMAS, 2004.
14. D. V. Pynadath and M. Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. JAIR, 16:389-423, 2002.
15. C. Shannon. A mathematical theory of communication. The Bell Labs Technical Journal, pages 379-457,623,656, 1948.
16. S. Vavasis. Nonlinear optimization: Complexity issues. In University Press, New York, 1991.