资源分类
》 资源 》论文》An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees

An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees

2019-11-05 | |  61 |   40 |   0
Abstract Very often, we have to look into multiple agents’ preferences, and compare or aggregate them. In this paper, we consider the well-known model, namely, lexicographic preference trees (LP-trees), for representing agents’ preferences in combinatorial domains. We tackle the problem of calculating the dissimilarity/distance between agents’ LPtrees. We propose an algorithm LpDis to compute the number of disagreed pairwise preferences between agents by traversing their LP-trees. The proposed algorithm is computationally efficient and allows agents to have different attribute importance structures and preference dependencies.

上一篇：Counterfactual Resimulation for Causal Analysis of Rule-Based Models

下一篇：Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...