Jonathan P. Pearce
Research Subjects
Jonathan P. Pearce has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Milind Tambe
University of Southern California
3 shared publications - Sarit Kraus
Department of Computer Science Bar Ilan University Israel
2 shared publications Fernando Ordóñez
1 shared publication- Fernando Ordóñez
University of Southern California
1 shared publication - Janusz Marecki
IBM Research
1 shared publication - Janusz Marecki
Business Analytics and Mathematical Sciences IBM T.J. Watson Research Center Yorktown NY
1 shared publication
Latest Publications
- 12 December 2011
- Published by Cambridge University Press (CUP)
- p. 131-155
Coordinating Randomized Policies for Increasing the Security of Agent Systems
Introduction Security, commonly defined as the ability to deal with intentional threats from other agents, is a major challenge for agents deployed in adversarial environments (Paruchuri et al., 2006). In this paper, we focus on adversarial domains in which the agents have limited information about the adversaries. Such adversarial scenarios arise in a wide variety of situations that are becoming increasingly important, such as patrol agents providing security for a group of houses or regions (Carroll et al., 2005; Paruchuri et al., 2007), UAVs monitoring a humanitarian mission (Beard and Mclain, 2003; Paruchuri et al., 2006), agents assisting in routine security checks at airports (Poole and Passantino, 2003), agents providing privacy in sensor network routing (Ozturk, Zhang, and Trappe, 2004), and agents maintaining anonymity in peer-to-peer networks (Borisov and Waddle, 2005). This paper brings together some of our recent work on how to plan for agents acting in uncertain environments in the presence of adversaries (Paruchuri et al., 2006, 2007, 2008). This research has introduced two very different approaches to increasing security in agent systems and has lead to the ARMOR (Assistant for Randomized Monitoring over Routes) system, which has been deployed for security scheduling at the LAX airport since August 2007 (Murr, 2007; Paruchuri et al., 2008; Pita et al., 2008). Here we will present the main results and algorithms proposed in these two approaches and highlight the relationship between them.
- 12 December 2011
- Published by Cambridge University Press (CUP)
- p. 131-155
Coordinating Randomized Policies for Increasing the Security of Agent Systems
Introduction Security, commonly defined as the ability to deal with intentional threats from other agents, is a major challenge for agents deployed in adversarial environments (Paruchuri et al., 2006). In this paper, we focus on adversarial domains in which the agents have limited information about the adversaries. Such adversarial scenarios arise in a wide variety of situations that are becoming increasingly important, such as patrol agents providing security for a group of houses or regions (Carroll et al., 2005; Paruchuri et al., 2007), UAVs monitoring a humanitarian mission (Beard and Mclain, 2003; Paruchuri et al., 2006), agents assisting in routine security checks at airports (Poole and Passantino, 2003), agents providing privacy in sensor network routing (Ozturk, Zhang, and Trappe, 2004), and agents maintaining anonymity in peer-to-peer networks (Borisov and Waddle, 2005). This paper brings together some of our recent work on how to plan for agents acting in uncertain environments in the presence of adversaries (Paruchuri et al., 2006, 2007, 2008). This research has introduced two very different approaches to increasing security in agent systems and has lead to the ARMOR (Assistant for Randomized Monitoring over Routes) system, which has been deployed for security scheduling at the LAX airport since August 2007 (Murr, 2007; Paruchuri et al., 2008; Pita et al., 2008). Here we will present the main results and algorithms proposed in these two approaches and highlight the relationship between them.
- 24 January 2009
- Published by Springer Nature in Information Technology and Management
- Vol. 10 (1) , 67-79
Coordinating randomized policies for increasing security of agent systems
- 24 January 2009
- Published by Springer Nature in Information Technology and Management
- Vol. 10 (1) , 67-79
Coordinating randomized policies for increasing security of agent systems
- 27 February 2006
- Published by Springer Nature
- p. 127-146
A Family of Graphical-Game-Based Algorithms for Distributed Constraint Optimization Problems
- 27 February 2006
- Published by Springer Nature
- p. 127-146
A Family of Graphical-Game-Based Algorithms for Distributed Constraint Optimization Problems