STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Optimality of Randomized $\alpha$-$\beta$ Search
SIAM Journal on Computing
Randomized algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Matching nuts and bolts in O(n log n) time
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Safeguarding and Charging for Information on the Internet
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Economic Framework for Pricing and Charging in Digital Libraries
Economic Framework for Pricing and Charging in Digital Libraries
Efficient information gathering on the Internet
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Extremal Graph Theory
A new strategy for querying priced information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the competitive ratio of evaluating priced functions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding optimal satisficing strategies for and-or trees
Artificial Intelligence
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Querying priced information in databases: The conjunctive case
ACM Transactions on Algorithms (TALG)
The hardness of the Expected Decision Depth problem
Information Processing Letters
A note on the size of minimal covers
Information Processing Letters
Efficiency-quality tradeoffs for vector score aggregation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Finding an optimal tree searching strategy in linear time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A randomized competitive algorithm for evaluating priced AND/OR trees
Theoretical Computer Science
Finding optimal satisficing strategies for and-or trees
Artificial Intelligence
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
On the competitive ratio of evaluating priced functions
Journal of the ACM (JACM)
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Discrete Applied Mathematics
Binary identification problems for weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
An optimal algorithm for querying priced information: monotone boolean functions and game trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The binary identification problem for weighted trees
Theoretical Computer Science
| Hi-index | 0.00 |
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 apply the 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 provide 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. We also investigate a model for pricing in this framework and construct, for every AND/OR tree, a set of prices that satisfies a very strong type of equilibrium property.