Query strategies for priced information
From MaRDI portal
Publication:696973
DOI10.1006/JCSS.2002.1828zbMATH Open1015.68244OpenAlexW2130519052WikidataQ57904549 ScholiaQ57904549MaRDI QIDQ696973FDOQ696973
Moses Charikar, Venkatesan Guruswami, Prabhakar Raghavan, Jon M. Kleinberg, Ronald Fagin
Publication date: 12 September 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fbfefe2f1ecc097fd267a7e351985c3cf5224fc2
Recommendations
- A new strategy for querying priced information
- Query strategies for priced information (extended abstract)
- Querying priced information in databases, the conjunctive case
- LATIN 2004: Theoretical Informatics
- Pricing strategies for information goods
- On pricing approximate queries
- Query-Based Data Pricing
- Bayesian pricing strategy for information goods
- A dynamic dictionary for priced information with application
- Algorithms and Computation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The minimum latency problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds on probabilistic linear decision trees
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions
- On the Optimality of Randomized $\alpha$-$\beta$ Search
Cited In (20)
- Pricing Diagnostic Information
- A randomized competitive algorithm for evaluating priced AND/OR trees
- Simple algorithms for stochastic score classification with small approximation ratios
- The hardness of the expected decision depth problem
- Sorting and Selection with Random Costs
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Explorable uncertainty in scheduling with non-uniform testing times
- Finding optimal satisficing strategies for and-or trees
- Algorithms and Computation
- Query-Based Data Pricing
- The binary identification problem for weighted trees
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Operations research applications of dichotomous search
- Competitive evaluation of threshold functions in the priced information model
- Computing similarity distances between rankings
- A note on the size of minimal covers
- Energy efficient sorting, selection and searching
- Generalized sorting with predictions revisited
- Computing with Priced Information: When the Value Makes the Price
- Evaluation of monotone DNF formulas
This page was built for publication: Query strategies for priced information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696973)
