Computer Science – Computer Science and Game Theory
Scientific paper
2011-10-12
Journal Of Artificial Intelligence Research, Volume 28, pages 49-105, 2007
Computer Science
Computer Science and Game Theory
Scientific paper
10.1613/jair.2034
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 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.
Everaere P.
Konieczny S.
Marquis Pierre
No associations
LandOfFree
The Strategy-Proofness Landscape of Merging does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Strategy-Proofness Landscape of Merging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Strategy-Proofness Landscape of Merging will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634776