Information Acquisition Policies for Resource Allocation Among Multiple Agents

J. C. Moore, H. R. Rao, A. Whinston, K. Nam and T. S. Raghu
Additional contact information
J. C. Moore: Krannert Graduate School of Management, Purdue University, W. Lafayette, Indiana 47907
H. R. Rao: School of Management, State University of New York at Buffalo, Buffalo, New York 14260
A. Whinston: MSIS, College of Business Administration, University of Texas at Austin, Austin, Texas 78712
K. Nam: School of Management, State University of New York at Buffalo, Buffalo, New York 14260
T. S. Raghu: School of Management, State University of New York at Buffalo, Buffalo, New York 14260

Information Systems Research, 1997, vol. 8, issue 2, 151-170

Abstract: This paper investigates a problem of resource allocation, where a manager allocates discrete resources among multiple agents in a team in a socially optimal manner. In making this allocation, the manager needs to understand the preference orders of the agents for the discrete resources. The manager does this by adopting an information acquisition policy. Three different information acquisition policies are investigated here. The trade off between the amount of information elicited and the costs involved are studied for each of the policies.

Keywords: information acquisition policies; discrete resource allocation; team problem solving (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/isre.8.2.151 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orisre:v:8:y:1997:i:2:p:151-170

Access Statistics for this article

More articles in Information Systems Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().