ACM Home Page
Please provide us with feedback. Feedback
A utility theoretic approach to determining optimal wait times in distributed information retrieval
Full text PdfPdf (279 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Salvador, Brazil
SESSION: Distributed table of contents
Pages: 91 - 97  
Year of Publication: 2005
ISBN:1-59593-034-5
Author
Kartik Hosanagar  The Wharton School at The University of Pennsylvania, Philadelphia, PA
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 62,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1076034.1076052
What is a DOI?

ABSTRACT

Distributed IR systems query a large number of IR servers, merge the retrieved results and display them to users. Since different servers handle collections of different sizes, have different processing and bandwidth capacities, there can be considerable heterogeneity in their response times. The broker in the distributed IR system thus has to make decisions regarding terminating searches based on perceived value of waiting -- retrieving more documents -- and the costs imposed on users by waiting for more responses. In this paper, we apply utility theory to formulate the broker's decision problem. The problem is a stochastic nonlinear program. We use Monte Carlo simulations to demonstrate how the optimal wait time may be determined in the context of a comparison shopping engine that queries multiple store websites for price and product information. We use data gathered from 30 stores for a set of 60 books. Our research demonstrates how a broker can leverage information about past retrievals regarding distributions of server response time and relevance scores to optimize its performance. Our main contribution is the formulation of the decision model for optimal wait time and proposal of a solution method. Our results suggest that the optimal wait time is highly sensitive to the manner in which users value from a set of retrieved results differs from the sum of user value from each result evaluated independently. We also find that the optimal wait time increases with the size of the distributed collections, but only if user utility from a set of results is nearly equal to the sum of utilities from each result.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
4
5
6
7
 
8
 
9
Johnson, Eric J. and J. W. Payne (1985), "Effort and accuracy in choice", Management Science, 31, pp. 394--414.
 
10
Kehoe, Colleen, J. Pitkow, K. Sutton, G. Agarwal and J. D. Rogers (1999), "Results of the Graphics, Visualization and Usability Tenth World Wide Web User Survey," Working Paper.
 
11
Larcker, D. F. and V. P. Lessig, "Perceived Usefulness of Information: A Psychometric Examination," Decision Sciences, 11, 1, 1980.
 
12
 
13
McFadden, D. (1980), "Econometric Models of Probabilistic Choice Among Products", Journal of Business.
 
14
 
15
Moffat and J. Zobel. Information retrieval systems for large document collections. In D. K. Harman, editor, The Third Text REtrieval Conference (TREC3) , Gaithersburg, MD, 1995.
 
16
 
17
 
18
Shugan, Steven M. (1980), "The Cost of Thinking", Journal of Consumer Research, Vol. 7, September, pp. 99--111.
 
19
Smith, Michael D., and Erik Brynjolfsson. "Customer Decision Making at an Internet Shopbot: Brand Still Matters," The Journal of Industrial Economics, 49(4) 541--558, 2001.
20
21
 
22