Sharing Information with Competitors
This addresses a problem in secure multiparty computation for agents seeking to share information while maintaining exclusivity, but it appears incremental as it builds on existing settings without claiming broad breakthroughs.
The paper tackles the mechanism design problem for agents rewarded with information in joint computations, aiming to motivate participation even from those with high-quality inputs, and formally studies problems like set union, intersection, and average.
We study the mechanism design problem in the setting where agents are rewarded using information only. This problem is motivated by the increasing interest in secure multiparty computation techniques. More specifically, we consider the setting of a joint computation where different agents have inputs of different quality and each agent is interested in learning as much as possible while maintaining exclusivity for information. Our high level question is to design mechanisms that motivate all agents (even those with high-quality input) to participate in the computation and we formally study problems such as set union, intersection, and average.