{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T04:13:01Z","timestamp":1730002381397,"version":"3.28.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>We propose new operators for weighted propositional belief merging operators.\n\nWe introduce distance-based operators that use the product as aggregation function.\n\nIn social choice theory, the product, called the Nash welfare function, is known  to be a more equitable  social welfare function than the classical utilitarian welfare function (based on a sum).\n\nWe study which  properties are satisfied by the obtained corresponding weighted merging operators.\n\nIn particular, we show that, unlike the Nash welfare function, distance-based  operators using the product do not satisfy the Pigou-Dalton property.\n\nThen, we introduce a new family of weighted merging operators, which we call utility-based weighted merging operators, where the utility is roughly the converse of a distance for distance-based operators.\n\nFor most well-known distance-based operators, it is easy to find the corresponding utility-based merging operators.\n\nBut an interesting result is that the utility-based weighted merging operator based on the product does not correspond to any standard distance-based weighted merging operator, and this operator satisfies the Pigou-Dalton property.<\/jats:p>","DOI":"10.24963\/kr.2024\/31","type":"proceedings-article","created":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:30:28Z","timestamp":1729924228000},"page":"329-338","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Merging Operators: Product, Utility-based Operators and Egalitarianism"],"prefix":"10.24963","author":[{"given":"Patricia","family":"Everaere","sequence":"first","affiliation":[{"name":"Cristal, CNRS, Universit\u00e9 de Lille"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Konieczny","sequence":"additional","affiliation":[{"name":"CRIL - CNRS, Universit\u00e9 d'Artois"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"Pino P\u00e9rez","sequence":"additional","affiliation":[{"name":"CRIL - CNRS, Universit\u00e9 d'Artois"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}","theme":"Artificial Intelligence","location":"Hanoi, Vietnam","acronym":"KR-2024","number":"21","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"start":{"date-parts":[[2024,11,1]]},"end":{"date-parts":[[2024,11,8]]}},"container-title":["Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:30:34Z","timestamp":1729924234000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2024\/31"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2024\/31","relation":{},"subject":[],"published":{"date-parts":[[2024,11]]}}}