This Paper provides a game theoretic extension of Radner's (1993) model of hierarchical information aggregation. It studies the role of the hierarchy design for the speed and quality of a collective decision process. The hierarchy is described as a programmed network of agents. The programme describes how information is processed within the network. The network of P identical managers has to aggregate information in the form of a set of n data items in order to make an informed decision. Each manager benefits from reaching an accurate decision but suffers from an individual cost of effort, which has to be provided in order to understand the information contained in a data item properly. We find that decentralized information processing increases incentives for information provision. There may be boundaries on the appropriate extend of decentralization, however. We also compare three different hierarchy designs: two balanced hierarchies and the fastest (skip-level) hierarchy, proposed by Radner. Skip-level reporting outperforms balanced hierarchies in terms of decision speed and in terms of decision quality.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Publisher Info
Paper provided by C.E.P.R. Discussion Papers in its series CEPR Discussion Papers with number
4397.
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)