An optimal algorithm for querying priced information: monotone boolean functions and game trees

Authors:
Ferdinando Cicalese;Eduardo Sany Laber
Affiliations:
Institut für Bioinformatik, Universität Bielefeld, Germany;Department of Informatics, PUC, Rio de Janeiro, Brasil
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 8
Cited 2

Combinatorial characterization of read-once formulae

Discrete Mathematics - Special issue on combinatorics and algorithms
On computing functions with uncertainty

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Selection with monotone comparison costs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Query strategies for priced information

Journal of Computer and System Sciences - Special issue on STOC 2000
Sorting and Selection with Structured Costs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A new strategy for querying priced information

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Querying priced information in databases: The conjunctive case

ACM Transactions on Algorithms (TALG)

Sorting and selection with random costs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the competitive ratio of evaluating priced functions

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study competitive function evaluation in the context of computing with priced information. A function f has to be evaluated for a fixed but unknown choice of the values of the variables. Each variable x of f has an associated cost c(x), which has to be paid to read the value of x. The problem is to design algorithms that compute the function querying the values of the variables sequentially while trying to minimize the total cost incurred. The evaluation of the performance of the algorithms is made by employing competitive analysis. We determine the best possible extremal competitive ratio for the classes of threshold trees, game trees, and monotone boolean functions with constrained minterms, by providing a polynomial-time algorithm whose competitiveness matches the known lower bounds.