Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs
In this paper, the authors propose a Relay Assignment protocol (RA-VCG) for cooperative communication to maximize the total social value (i.e., the total true value of all pairs) while guaranteeing truthfulness in an auction-theoretic sense by charging each pair an extra payment. Specially, RA-VCG implements a variation of the well-known VCG mechanism for the truthful relay assignment problem in the network with selfish source-destination pairs. Then, they prove the validity of this protocol and also show several surprising properties (such as no positive transfer and individual rationality) associated with this protocol. The simulation results show that the total social value achieved when each node takes untruthfully is about 23.3% less than that achieved when nodes behave truthfully.