We consider a class of problems in which an algorithm seeks to compute a function f over a set of n inputs, where each input has an associated price. The algorithm queries inputs sequentially, trying to learn the value of the function for the minimum cost. We a p p l y t h e competitive analysis of algorithms to this framework, designing algorithms that incur large cost only when the cost of the cheapest \proof" for the value of f is also large. We p r o vide algorithms that achieve the optimal competitive ratio for functions that include arbitrary Boolean AND/OR trees, and for the problem of searching in a sorted array. W e also investigate a model for pricing in this framework and construct, for every AND/OR tree, a set of prices that satis es a very strong type of equilibrium property.
Computing a function over Ò inputs is studied in the framework of boolean and/or trees REF , where the source data is accurate and each input has an associated price.
Query Strategies for Priced Information
J. Comput. Syst. Sci.
J. Comput. Syst. Sci.
Computer Science