DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents

Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has addressed cooperating agents, and privacy was frequently mentioned as a significant motivation of the decentralization. While privacy may have a role for cooperating agents, it is easier understood in the context of self-interested utility-based agents, and this is the situation considered here. With utility-based agents, the DisCSP framework can be extended to model privacy and satisfaction under the concept of utility. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP), an extension of the DisCSP that exploits the rewards for finding a solution and the costs for losing privacy as guidance for the utility-based agents. A parallel can be drawn between Partially Observable Markov Decision Processes (POMDPs) and the problems solved by individual agents for UDisCSPs. Common DisCSP solvers are extended to take into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the ones available in the corresponding solver protocols. The solvers obtained propose the action to be performed in each situation, defining thereby the policy of the agents.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages359-366
Number of pages8
ISBN (Electronic)9781509044702
DOIs
Publication statusPublished - Jan 12 2017
Event2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016 - Omaha, United States
Duration: Oct 13 2016Oct 16 2016

Publication series

NameProceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016

Other

Other2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016
CountryUnited States
CityOmaha
Period10/13/1610/16/16

Fingerprint

Constraint satisfaction problems
Planning
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications

Cite this

Savaux, J., Vion, J., Piechowiak, S., Mandiau, R., Matsui, T., Hirayama, K., ... Silaghi, M. (2017). DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents. In Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016 (pp. 359-366). [7817074] (Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WI.2016.0057

DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents. / Savaux, Julien; Vion, Julien; Piechowiak, Sylvain; Mandiau, Rene; Matsui, Toshihiro; Hirayama, Katsutoshi; Yokoo, Makoto; Elmane, Shakre; Silaghi, Marius.

Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 359-366 7817074 (Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Savaux, J, Vion, J, Piechowiak, S, Mandiau, R, Matsui, T, Hirayama, K, Yokoo, M, Elmane, S & Silaghi, M 2017, DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents. in Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016., 7817074, Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016, Institute of Electrical and Electronics Engineers Inc., pp. 359-366, 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016, Omaha, United States, 10/13/16. https://doi.org/10.1109/WI.2016.0057
Savaux J, Vion J, Piechowiak S, Mandiau R, Matsui T, Hirayama K et al. DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents. In Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 359-366. 7817074. (Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016). https://doi.org/10.1109/WI.2016.0057
Savaux, Julien ; Vion, Julien ; Piechowiak, Sylvain ; Mandiau, Rene ; Matsui, Toshihiro ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Elmane, Shakre ; Silaghi, Marius. / DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents. Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 359-366 (Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016).
@inproceedings{5a848542b1474a8fa9d6d120e92c9200,
title = "DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents",
abstract = "Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has addressed cooperating agents, and privacy was frequently mentioned as a significant motivation of the decentralization. While privacy may have a role for cooperating agents, it is easier understood in the context of self-interested utility-based agents, and this is the situation considered here. With utility-based agents, the DisCSP framework can be extended to model privacy and satisfaction under the concept of utility. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP), an extension of the DisCSP that exploits the rewards for finding a solution and the costs for losing privacy as guidance for the utility-based agents. A parallel can be drawn between Partially Observable Markov Decision Processes (POMDPs) and the problems solved by individual agents for UDisCSPs. Common DisCSP solvers are extended to take into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the ones available in the corresponding solver protocols. The solvers obtained propose the action to be performed in each situation, defining thereby the policy of the agents.",
author = "Julien Savaux and Julien Vion and Sylvain Piechowiak and Rene Mandiau and Toshihiro Matsui and Katsutoshi Hirayama and Makoto Yokoo and Shakre Elmane and Marius Silaghi",
year = "2017",
month = "1",
day = "12",
doi = "10.1109/WI.2016.0057",
language = "English",
series = "Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "359--366",
booktitle = "Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016",
address = "United States",

}

TY - GEN

T1 - DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents

AU - Savaux, Julien

AU - Vion, Julien

AU - Piechowiak, Sylvain

AU - Mandiau, Rene

AU - Matsui, Toshihiro

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Elmane, Shakre

AU - Silaghi, Marius

PY - 2017/1/12

Y1 - 2017/1/12

N2 - Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has addressed cooperating agents, and privacy was frequently mentioned as a significant motivation of the decentralization. While privacy may have a role for cooperating agents, it is easier understood in the context of self-interested utility-based agents, and this is the situation considered here. With utility-based agents, the DisCSP framework can be extended to model privacy and satisfaction under the concept of utility. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP), an extension of the DisCSP that exploits the rewards for finding a solution and the costs for losing privacy as guidance for the utility-based agents. A parallel can be drawn between Partially Observable Markov Decision Processes (POMDPs) and the problems solved by individual agents for UDisCSPs. Common DisCSP solvers are extended to take into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the ones available in the corresponding solver protocols. The solvers obtained propose the action to be performed in each situation, defining thereby the policy of the agents.

AB - Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has addressed cooperating agents, and privacy was frequently mentioned as a significant motivation of the decentralization. While privacy may have a role for cooperating agents, it is easier understood in the context of self-interested utility-based agents, and this is the situation considered here. With utility-based agents, the DisCSP framework can be extended to model privacy and satisfaction under the concept of utility. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP), an extension of the DisCSP that exploits the rewards for finding a solution and the costs for losing privacy as guidance for the utility-based agents. A parallel can be drawn between Partially Observable Markov Decision Processes (POMDPs) and the problems solved by individual agents for UDisCSPs. Common DisCSP solvers are extended to take into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the ones available in the corresponding solver protocols. The solvers obtained propose the action to be performed in each situation, defining thereby the policy of the agents.

UR - http://www.scopus.com/inward/record.url?scp=85013073484&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013073484&partnerID=8YFLogxK

U2 - 10.1109/WI.2016.0057

DO - 10.1109/WI.2016.0057

M3 - Conference contribution

AN - SCOPUS:85013073484

T3 - Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016

SP - 359

EP - 366

BT - Proceedings - 2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -