Handbook of logic in artificial intelligence and logic programming (vol. 3)
A Practical Approach to Fusing Prioritized Knowledge Bases
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Iterated theory base change: a computational model
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Social contraction and belief negotiation
Information Fusion
Social choice theory, belief merging, and strategy-proofness
Information Fusion
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Some representation and computational issues in social choice
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merging of structures in which it is possible to encode the preferences of sources [5,4,12,13,14,1]. Information merging has much in common with the goals of social choice theory: to define operations reflecting the preferences of a society from the individual preferences of the members of the society. Given this connection it seems reasonable to require that any framework for the merging of information has to provide satisfactory ways of dealing with the problems raised in social choice theory. In this paper we investigate the link between the merging of epistemic states and two important results in social choice theory. We show that Arrow's well-known impossibility theorem [2] can be circumvented when the preferences of sources are represented in terms of epistemic states. This is achieved by providing a consistent set of properties for merging from which Arrow-like properties can be derived. We extend this to a consistent framework which includes properties corresponding to the notion of being strategy-proof. The existence of such an extended framework can be seen as a circumvention of the impossibility result of Gibbard and Satterthwaite [8,17,18] and related results [6, 3].