A multiple-agent logic, which associates subsets of agents to logical formulas, has been recently proposed. The paper presents a graphical counterpart of this logic, based on a multiple agent version of possibilistic conditioning, and applies it to preference modeling. First, preferences of agents are supposed to be all or nothing. We discuss how one can move from the network to the logic representation and vice-versa. The new representation enables us to focus on networks associated to subsets of agents, and to identify inconsistent agents, or conflicting subsets of agents. The question of optimization and dominance queries is discussed. Finally, the paper outlines an extension where gradual preferences are handled.
CITATION STYLE
Amor, N. B., Dubois, D., Gouider, H., & Prade, H. (2017). Graphical representations of multiple agent preferences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10351 LNCS, pp. 142–153). Springer Verlag. https://doi.org/10.1007/978-3-319-60045-1_17
Mendeley helps you to discover research relevant for your work.