{"type":"ScholarlyArticle","title":"An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees","authors":[{"name":"Minyi Li","slug":"minyi-li","given":"Minyi","family":"Li","affiliation":"Monash University , Australia"},{"name":"Borhan Kazimipour","slug":"borhan-kazimipour","given":"Borhan","family":"Kazimipour","affiliation":"Monash University , Australia"}],"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' LP-trees. 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.","doi":"10.24963/ijcai.2018/262","url":"https://ijcai.org/proceedings/2018/262","pdf":"https://ijcai.org/proceedings/2018/0262.pdf","markdown":"https://ijcai.org/proceedings/2018/262.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/262","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":262,"pages":{"first":1898,"last":1904},"keywords":["Knowledge Representation and Reasoning: Preference Modelling and Preference-Based Reasoning","Agent-based and Multi-agent Systems: Computational Social Choice","Knowledge Representation and Reasoning: Knowledge Representation Languages","Knowledge Representation and Reasoning: Knowledge Representation and  Game Theory ; Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Booth et al., 2011] Richard Booth, Yann Chevaleyre, Jérôme Lang, Jérôme Mengin, and Chattrakul Sombat- theera. Learning conditionally lexicographic preference relations. In Proceedings of the 23rd Benelux Conference on Artificial Intelligence, pages 371-372, 2011.","title":"Learning conditionally lexicographic preference relations","authors":"Richard Booth, Yann Chevaleyre, Jérôme Lang, Jérôme Mengin, Chattrakul Sombattheera","year":"2011","venue":"Proceedings of the 23rd Benelux Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bräuning et al., 2017] Michael Bräuning, Eyke Hüller- meier, Tobias Keller, and Martin Glaum. Lexicographic preferences for predictive modeling of human decision making: A new machine learning method with an appli- cation in accounting. European Journal of Operational Research, 258(1):295-306, 2017.","title":"Lexicographic preferences for predictive modeling of human decision making: A new machine learning method with an application in accounting","authors":"Michael Bräuning, Eyke Hüllermeier, Tobias Keller, Martin Glaum","year":"2017","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cover and Hart, 1967] Thomas Cover and Peter Hart. Near- est neighbor pattern classification. IEEE transactions on information theory, 13(1):21-27, 1967.","title":"Thomas Cover and Peter Hart. Nearest neighbor pattern classification","authors":"Hart Cover","year":"1967","venue":"IEEE transactions on information theory","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Grbovic et al., 2013] Mihajlo Grbovic, Nemanja Djuric, Shengbo Guo, and Slobodan Vucetic. Supervised cluster- ing of label ranking data using label preference informa- tion. Machine Learning, 93(2):191-225, Nov 2013.","title":"Supervised clustering of label ranking data using label preference information","authors":"Grbovic","year":"2013","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Hartigan and Wong, 1979] John A Hartigan and Manchek A Wong. Algorithm as 136: A k-means clustering algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1):100-108, 1979.","title":"Algorithm as 136: A k-means clustering algorithm","authors":"A John, Manchek A Hartigan, Wong","year":"1979","venue":"Journal of the Royal Statistical Society. Series C (Applied Statistics)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Horniaček, 2008] Milan Horniaček. Negotiation, prefer- ences over agreements, and the core. International Journal of Game Theory, 37(2):235-249, Jun 2008.","title":"Milan Horniaček. Negotiation, preferences over agreements, and the core","authors":"Horniaček","year":"2008","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Hüllermeier et al., 2008] Eyke Hüllermeier, Johannes Fürnkranz, Weiwei Cheng, and Klaus Brinker. Label ranking by learning pairwise preferences. Artificial Intelligence, 172(16):1897 -1916, 2008.","title":"Label ranking by learning pairwise preferences","authors":"Eyke Hüllermeier, Johannes Fürnkranz, Weiwei Cheng, Klaus Brinker","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Lang et al., 2012] Jérôme Lang, Jérôme Mengin, and Lirong Xia. Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains, pages 973-987. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.","title":"Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains","authors":"Jérôme Lang, Jérôme Mengin, Lirong Xia","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Liu and Truszczynski, 2015] Xudong Liu and Miroslaw Truszczynski. Learning partial lexicographic preference trees over combinatorial domains. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pages 1539-1545. AAAI Press, 2015.","title":"Learning partial lexicographic preference trees over combinatorial domains","authors":"Xudong Liu, Miroslaw Truszczynski","year":"2015","venue":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Schmitt and Martignon, 2006] Michael Schmitt and Laura Martignon. On the complexity of learning lexicographic strategies. Journal of Machine Learning Research, 7:55- 83, 2006.","title":"On the complexity of learning lexicographic strategies","authors":"Martignon Schmitt, Michael Schmitt, Laura Martignon","year":"2006","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Todorovski et al., 2002] Ljupco Todorovski, Hendrik Bloc- keel, and Saso Dzeroski. Ranking with Predictive Clus- tering Trees, pages 444-455. Springer Berlin Heidelberg, Berlin, Heidelberg, 2002.","title":"Ranking with Predictive Clustering Trees","authors":"Todorovski","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Vembu and Gärtner, 2011] Shankar Vembu and Thomas Gärtner. Label Ranking Algorithms: A Survey, pages 45- 64. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.","title":"Label Ranking Algorithms: A Survey","authors":"Gärtner Vembu, Shankar Vembu, Thomas Gärtner","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Wilson, 2004] Nic Wilson. Extending cp-nets with stronger conditional preference statements. In AAAI, volume 4, pages 735-741, 2004.","title":"Extending cp-nets with stronger conditional preference statements","authors":"Nic Wilson","year":"2004","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Wilson, 2006] Nic Wilson. An efficient upper approxima- tion for conditional preference. In Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -September 1, 2006, Riva Del Garda, Italy, pages 472-476, Amsterdam, The Netherlands, The Netherlands, 2006. IOS Press.","title":"An efficient upper approximation for conditional preference","authors":"Nic Wilson","year":"2006","venue":"Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Wilson, 2014] Nic Wilson. Preference inference based on lexicographic models. In Proceedings of the Twenty- first European Conference on Artificial Intelligence, ECAI'14, pages 921-926, Amsterdam, The Netherlands, The Netherlands, 2014. IOS Press.","title":"Preference inference based on lexicographic models","authors":"Nic Wilson","year":"2014","venue":"Proceedings of the Twentyfirst European Conference on Artificial Intelligence, ECAI'14","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Yaman et al., 2008] Fusun Yaman, Thomas J. Walsh, Michael L. Littman, and Marie desJardins. Democratic ap- proximation of lexicographic preference models. In ICML, volume 307 of ACM International Conference Proceeding Series, pages 1200-1207. ACM, 2008.","title":"Democratic approximation of lexicographic preference models","authors":"Fusun Yaman, Thomas J Walsh, Michael L Littman, Marie Desjardins","year":"2008","venue":"ACM International Conference Proceeding Series","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}