Information elicitation and sequential mechanisms
- First Online:
- 206 Downloads
We study an incomplete information mechanism design problem with three peculiarities. First, access to agents’ private information is costly and unobservable. Second, the mechanism may communicate sequentially with the agents. Third, the mechanism designer and all the agents share a common interest. As an example one can think of N geologists that study the potential oil reserves in some tract. The geologists agree on the right course of action, given their N studies. However, carrying out the study may be costly for a geologist and so he may opt to fabricate a study. The oil company that employs these geologists need not contract them simultaneously and may, furthermore, choose to provide some of the results of early studies to geologists employed later on. Finally, the geologists and the oil company would like the joint study to forecast the quantity of oil reserves as accurate as possible. It turns out that, in such settings, what may not be implementable without communication becomes implementable with communication. Clearly, the possibility for sequential communication introduces a lot of complexity to the design problem. However, we provide a result in the spirit of the revelation principle and argue that whenever implementation is possible with communication it is also possible with a simple communication mechanism. Formally, we extend the model and results in Smorodinsky and Tennenholtz (Games Econ Behav 55(2):385–406, 2006) who consider the similar problem but restrict attention to symmetric social choice functions and IID distributions over the private information.
KeywordsMechanism design Information elicitation Sequential mechanism Revelation principle
JEL ClassificationC72 D70 D82
Unable to display preview. Download preview PDF.
- Dekel E, Piccione M (1997) On the equivalence of simultaneous and sequential binary elections. Discussion Paper No. 1206, Northwestern University, Center for Mathematical Studies in Economics and Management ScienceGoogle Scholar
- McGrew R, Porter R, Shoham Y (2003) Towards a general theory of non-cooperative computation. In: Proceedings of the 9th conference of theoretical aspects of rationality and knowlede (TARK 2003), pp 59–71Google Scholar
- Ronen A, Wahrmann L (2005) Prediction games. In: The 1st workshop on internet and network economics (WINE)Google Scholar