This paper deals with the problem of classical planning for multiple cooperative agents who
have private information about their local state and capabilities they do not want to reveal …

Abstract Distributed Constraint Optimization (DCOP) is a powerful framework for
representing and solving distributed combinatorial problems, where the variables of the …

As large-scale theft of data from corporate servers is becoming increasingly common, it
becomes interesting to examine alternatives to the paradigm of centralizing sensitive data …

Abstract Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent
technique for multiagent coordination. However, despite agent privacy being a key …

Several naturally distributed negotiation/cooperation problems with privacy requirements
can be modeled within the distributed constraint satisfaction framework, where the …

With the rapid increase in computing, storage and networking resources, data is not only
collected and stored, but also analyzed. This creates a serious privacy problem which often …

Abstract Distributed Constraint Satisfaction (DCSP) has long been considered an important
problem in multi-agent systems research. This is because many real-world problems can be …

It is critical that agents deployed in real-world settings, such as businesses, offices,
universities and research laboratories, protect their individual users' privacy when …

The scope of mobile phones has skyrocketed in recent years to such an extent that
smartphone sales are expected to surpass those of PCs by the end of 2011. Equipped with …

In the contemporary information era, the ubiquitous collection of data from different parties
frequently accommodates significant mutual benefits to the involved participants. However …