Optimal allocation and backup of computer resources under asymmetric information and incentive incompatibility

• Published in: European journal of operational research 1996-06, Vol.91 (2), p.411-426
• Main Authors: Cheng, Hsing K., Freimer, Marshall, Richmond, William B., Sumita, Ushio
• Format: Article
• Language: English
• Subjects: Asymmetric information; Computer backup strategy; Game theory; Linear programming; Mechanism design; Resource allocation
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/0377-2217(94)00349-1

This paper presents the optimal allocation and backup of computing resources in a multidivisional firm in the presence of asymmetric information and incentive incompatibility. A game-theoretic model is developed and transformed to a linear programming problem. The solution to this linear programming problem enables the corporate headquarters to design a resource allocation scheme such that the revelation principle prevails and all divisions tell the truth. To cope with the combinatorial explosion of complexity caused by the resource constraint, a greedy-type algorithm and an averaged version of the original linear programming problem are developed to provide the upper and lower bounds. The greedy-type algorithm generates exact solutions for a wide range of instances. The lower bounds coincide with the exact solutions for the cases where the computer resource is either scarce or abundant. The averaged-version resource allocation model with slight modifications solves the optimal computer backup capacity problem. It determines how much back up capacity the firm should purchase when the firm's computer breaks down.