Valuations of Possible States (VPS): a quantitative framework for analysis of privacy loss among collaborative personal assistant agents

For agents deployed in real-world settings, such as businesses, universities and research laboratories, it is critical that agents protect their individual users' privacy when interacting with others entities. Indeed, privacy is recognized as a key motivating factor in design of several multiagent algorithms, such as distributed constraint optimization (DCOP) algorithms. Unfortunately, rigorous and general quantitative metrics for analysis and comparison of such multiagent algorithms with respect to privacy loss are lacking. This paper takes a key step towards developing a general quantitative model from which one can analyze and generate metrics of privacy loss by introducing the VPS (Valuations of Possible States) framework. VPS is shown to capture various existing measures of privacy created for specific domains of distributed constraint satisfactions problems (DCSPs). The utility of VPS is further illustrated via analysis of DCOP algorithms, when such algorithms are used by personal assistant agents to schedule meetings among users. In addition, VPS allows us to quantitatively evaluate the properties of several privacy metrics generated through qualitative notions. We obtain the unexpected result that decentralization does not automatically guarantee superior protection of privacy.

[1]  Amnon Meisels,et al.  Using additional information in DisCSPs search , 2004 .

[2]  Makoto Yokoo,et al.  Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..

[3]  Milind Tambe,et al.  Towards Adjustable Autonomy for the Real World , 2002, J. Artif. Intell. Res..

[4]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  Francesca Rossi,et al.  Multi‐Agent Constraint Systems with Preferences: Efficiency, Solution Quality, and Privacy Loss , 2004, Comput. Intell..

[6]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[7]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[8]  Francesca Rossi,et al.  Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality , 2002 .

[9]  Marius-Calin Silaghi,et al.  Distributed asynchronous search with private constraints (extended abstract) , 2000, AGENTS '00.

[10]  Marius-Calin Silaghi,et al.  Distributed constraint satisfaction and optimization with privacy enforcement , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[11]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..