Graphical Representations of Multiple Agent Preferences

Nahla Ben Amor (1) , Didier Dubois (2, 3) , Héla Gouider (1) , Henri Prade (2, 4, 3)

1 Université de Tunis
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
3 CNRS - Centre National de la Recherche Scientifique
4 UTS - University of Technology Sydney

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.

Mots clés: Possibilistic network; Multiple agent; Logic Preferences

Domaines: Système multi-agents [cs.MA]

Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade. Graphical Representations of Multiple Agent Preferences. 30th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE), Jun 2017, Arras, France. pp.142-153. ⟨hal-02626169⟩