Incentive Compatible Mechanism in P2P Systems

Author(s):  
Qingjie Wang ◽  
Jian Yu ◽  
Mei Yu ◽  
Jie Zhang ◽  
Zheng Zhao
2012 ◽  
Vol 5 (1) ◽  
pp. 12-25
Author(s):  
Calvin Blackwell

In a prediction contest participants compete for a prize by submitting guesses regarding an unknown variable; the winner of the contest is the participant who submits the most accurate guess. In this paper the results of a simple prediction contest are reported. In the contest, certain members of the administration of a medium-sized university were asked to predict the number of freshmen deposits the university would receive by its spring deadline. Contest participants were told that the contest participant who submitted the most accurate guess would receive a $100 prize. With this incentive-compatible mechanism in place, the average guess from the contest was used as a forecast for the number of deposits. This forecast was at least as accurate as any other simple forecast method.


Econometrica ◽  
2019 ◽  
Vol 87 (4) ◽  
pp. 1367-1390 ◽  
Author(s):  
Yi-Chun Chen ◽  
Wei He ◽  
Jiangtao Li ◽  
Yeneng Sun

We consider a general social choice environment that has multiple agents, a finite set of alternatives, independent types, and atomless type distribution. We show that for any Bayesian incentive compatible mechanism, there exists an equivalent deterministic mechanism that (1) is Bayesian incentive compatible; (2) delivers the same interim expected allocation probabilities and the same interim expected utilities for all agents; and (3) delivers the same ex ante expected social surplus. This result holds in settings with a rich class of utility functions, multidimensional types, interdependent valuations, and in settings without monetary transfers. To prove our result, we develop a novel methodology of mutual purification, and establish its link with the mechanism design literature.


Sign in / Sign up

Export Citation Format

Share Document