On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Possibilistic Merging and Distance-Based Fusion of Propositional Information
Annals of Mathematics and Artificial Intelligence
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Complexity of manipulating elections with few candidates
Eighteenth national conference on Artificial intelligence
Vote elicitation: complexity and strategy-proofness
Eighteenth national conference on Artificial intelligence
How many candidates are needed to make elections hard to manipulate?
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Artificial Intelligence - Special issue on nonmonotonic reasoning
Non-cooperative computation: boolean functions with correctness and exclusivity
Theoretical Computer Science - Game theory meets theoretical computer science
Social choice theory, belief merging, and strategy-proofness
Information Fusion
Universal voting protocol tweaks to make manipulation hard
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Quota and Gmin merging operators
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning under inconsistency: the forgotten connective
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Propositional merging operators based on set-theoretic closeness
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Journal of Artificial Intelligence Research
A Complete Conclusion-Based Procedure for Judgment Aggregation
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Disjunctive merging: Quota and Gmin merging operators
Artificial Intelligence
Review: logical mechanism design
The Knowledge Engineering Review
Belief merging using normal forms
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Crowd IQ: aggregating opinions to boost performance
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Introduction to judgment aggregation
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
Designing social choice mechanisms using machine learning
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Generalized scoring rules: a framework that reconciles Borda and Condorcet
ACM SIGecom Exchanges
Tasks for agent-based negotiation teams: Analysis, review, and challenges
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over the possible results of the merging process (i.e., the possible merged bases), she can try to rig the merging process by lying on her true beliefs/goals if this leads to a better merged base according to her point of view. Obviously, strategy-proof operators are highly desirable in order to guarantee equity among agents even when some of them are not sincere. In this paper, we draw the strategy-proof landscape for many merging operators from the literature, including model-based ones and formula-based ones. Both the general case and several restrictions on the merging process are considered.