Abstract
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. The cost of exploring a location is proportional to the depth to which it is drilled. The algorithm has no clue about the depths of the oil sources at the different locations or even if there are any. Abstraction of the oil searching problem applies naturally to several life contexts. Consider a researcher who wants to decide which research problems to invest time into. A natural dilemma whether to invest all the time into a few problems, or share time across many problems. When you have spent a lot of time on one problem with no success, should you continue or move to another problem?
One could study this problem using a competitive analysis that compares the cost of an algorithm to that of an adversary that knows the depths of the oil sources, but the competitive ratio of the best algorithm for this problem is Ω(n). Instead we measure the performance of a strategy by comparing it to a weaker adversary that knows the set of depths of the oil sources but does not know which location has what depth. Surprisingly, we find that to find k oil sources there is a strategy whose cost is close to that of any adversary that has this limited knowledge of only the set of depths. In particular, we show that if any adversary can find k oil sources with drilling cost B while knowing the set of depths, our strategy finds \(k - \tilde O(k^{5/6})\) sources with drilling cost B(1 + o(1)). This proves that our strategy is very close to the best possible strategy in the total absence of information.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gal, S.: Search Games. Academic Press, London (1980)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Dordrecht (2003)
Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inf. Comput. 106(2), 234–252 (1993)
Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63–79 (1996)
Kao, M.Y., Ma, Y., Sipser, M., Yin, Y.L.: Optimal constructions of hybrid algorithms. J. Algorithms 29(1), 142–164 (1998)
Kirkpatrick, D.: Hyperbolic dovetailing. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 516–527. Springer, Heidelberg (2009)
Robbins, H.: Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. 58, 527–535 (1952)
Gittins, J.C., Jones, D.M.: A dynamic allocation index for the sequential design of experiments. In: Progress in Statistics: European Meeting of Statisticians, vol. 1, pp. 241–266 (1974)
Whittle, P.: Arm-acquiring bandits. The Annals of Probability 9, 284–292 (1981)
Benkherouf, L., Pitts, S.: On a multidimensional oil exploration problem. Journal of Applied Mathematics and Stochastic Analysis 2005(2), 97–118 (2005)
Benkherouf, L., Glazebrook, K., Owen, R.: Gittins indices and oil exploration. J. Roy. Statist. Soc. Ser. B 54, 229–241 (1992)
Grayson, C.: Decisions Under Uncertainty: Drilling Decisions by Oil and Gas Operators. Harvard, Division of Research, Graduate School of Business Administration (1960)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McGregor, A., Onak, K., Panigrahy, R. (2009). The Oil Searching Problem. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)