Real-Time Hierarchical Resource Allocation with Quadratic Costs

39 Pages Posted: 8 Oct 2003

See all articles by Timothy Van Zandt

Timothy Van Zandt

INSEAD - Economics and Political Sciences; Centre for Economic Policy Research (CEPR)

Date Written: August 2003

Abstract

This Paper presents a model in which boundedly rational members of an administrative staff calculate resource allocations in real time. We consider a class of hierarchical procedures in which information about payoff functions flows up and is aggregated by a hierarchy, while allocations flow down and are disaggregated by the hierarchy with decentralized decision making. We assume that the payoff functions are quadratic and that the payoff parameters follow first-order autoregressive processes. We define a team statistical optimality condition that formalizes the notion of decentralized decision making. We derive a reduced form that can be used to address specific questions about organizational structure and returns to scale.

Keywords: Decentralization, hierarchies, bounded rationality, resource allocation, real-time computation

JEL Classification: D23, D83

Suggested Citation

Van Zandt, Timothy, Real-Time Hierarchical Resource Allocation with Quadratic Costs (August 2003). CEPR Discussion Paper No. 4022. Available at SSRN: https://ssrn.com/abstract=454140

Timothy Van Zandt (Contact Author)

INSEAD - Economics and Political Sciences ( email )

Boulevard de Constance
F-77305 Fontainebleau Cedex
France
+33 1 6072 4981 (Phone)
+33 1 6074 6192 (Fax)

Centre for Economic Policy Research (CEPR)

London
United Kingdom

Register to save articles to
your library

Register

Paper statistics

Downloads
22
Abstract Views
595
PlumX Metrics