z-logo
Premium
Reputation, Honesty, and Efficiency with Insider Information: an Experiment
Author(s) -
Charness Gary,
Garoupa Nuno
Publication year - 2000
Publication title -
journal of economics and management strategy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.672
H-Index - 68
eISSN - 1530-9134
pISSN - 1058-6407
DOI - 10.1111/j.1430-9134.2000.00425.x
Subject(s) - reputation , asset (computer security) , insider , misinformation , value (mathematics) , honesty , information asymmetry , microeconomics , business , incentive , insider trading , economics , actuarial science , finance , psychology , computer security , social psychology , computer science , machine learning , sociology , political science , law , social science
We conduct an experimental study of sales of insider information about an asset's future value, where the insiders cannot purchase the underlying asset. We examine whether such information is purchased, the quality of the information provided, and the subsequent accuracy of purchase decisions in the underlying asset market. Our design explores whether reputation, in a repeated game of finite (but uncertain) duration, is an effective constraint on deliberate strategic misinformation. The insiders have an immediate incentive to state that the asset value is high when its true value is low. We suggest an application to insider trading in financial information markets. With fixed matching, cooperative outcomes featuring truthful revelation are frequently achieved and sustained, even though this suggests subjects have sophisticated beliefs about the beliefs and behavior of others. As a comparison, we also conduct a control treatment with random rematching. Here, information purchase is less frequent, the rate of truthful revelation decreases, and efficiency is diminished. Our results suggest that most people anticipate that others realize the potential value of a good reputation.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here