Multi-agent conditional preference networks with incomplete and different structure

This paper addresses the problem of completing agents missing preferences structured via CP-nets in a multi-agent system. Existing approaches work under a strong and unrealistic assumption, supposing that all agents share the same dependency graph. The proposed approach supports different CP-net structures without any restriction over missing preferences which fits well with real problems. To evaluate its efficiency we propose a comparative study with existing approaches and an application on web service selection.