Sharing Information with Competitors

09/27/2018
by   Simina Branzei, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2023

Cost Sharing Public Project with Minimum Release Delay

We study the excludable public project model where the decision is binar...
research
07/21/2021

Truthful Information Elicitation from Hybrid Crowds

Suppose a decision maker wants to predict weather tomorrow by eliciting ...
research
05/11/2020

Secure Computation to Hide Functions of Inputs

We consider a two-user secure computation problem in which Alice and Bob...
research
02/22/2018

Eliciting Expertise without Verification

A central question of crowd-sourcing is how to elicit expertise from age...
research
10/04/2018

Turning Lemons into Peaches using Secure Computation

In many cases, assessing the quality of goods is hard. For example, when...
research
02/24/2018

Water from Two Rocks: Maximizing the Mutual Information

Our goal is to forecast ground truth Y using two sources of information ...
research
03/23/2019

Mechanism Design for Maximum Vectors

We consider the Maximum Vectors problem in a strategic setting. In the c...

Please sign up or login with your details

Forgot password? Click here to reset