Identifying the Best Agent in a Network

35 Pages Posted: 23 Nov 2016 Last revised: 24 Oct 2018

See all articles by Leonie Baumann

Leonie Baumann

University of Cambridge - Cambridge-INET Institute

Date Written: October 17, 2017

Abstract

This paper develops a mechanism for a principal to allocate a prize to the most valued agent when agents have a knowledge network. The principal does not know any agent's value but any two linked agents know each other's values. Agents compete for the prize and send costless private messages about their own value and the values of others they know to the principal. Agents can lie only to a certain extent and only lie if it increases their chances of winning the prize. A mechanism that determines each agent's chances of winning for any possible message profile is proposed. We show that with this mechanism, there exists an equilibrium such that the most valued agent wins with certainty if every agent has at least one link; if the network is a star or complete, then the most valued agent wins with certainty in every equilibrium.

Keywords: network, knowledge network, information network, mechanism design, principal-agents problem, allocation problem

JEL Classification: C72, D82, D83

Suggested Citation

Baumann, Leonie, Identifying the Best Agent in a Network (October 17, 2017). Available at SSRN: https://ssrn.com/abstract=2873888 or http://dx.doi.org/10.2139/ssrn.2873888

Leonie Baumann (Contact Author)

University of Cambridge - Cambridge-INET Institute ( email )

Sidgwick Avenue
Cambridge, CB3 9DD
United Kingdom

Register to save articles to
your library

Register

Paper statistics

Downloads
138
rank
197,420
Abstract Views
513
PlumX Metrics