Query strategies for priced information (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 582-591

  Charikar, Moses ^a   Fagin, Ronald ^b   Guruswami, Venkatesan ^c   Kleinberg, Jon ^d   Raghavan, Prabhakar ^b   Sahai, Amit ^c  

^a Stanford University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ANALYSIS; EQUILIBRIUM PROPERTIES; EXTENDED ABSTRACTS; MINIMUM COST; OPTIMAL COMPETITIVE RATIOS; PRICED INFORMATION; QUERY STRATEGIES;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; COSTS; FORESTRY; COMPUTER SYSTEMS PROGRAMMING; THEOREM PROVING; TREES (MATHEMATICS);

COST BENEFIT ANALYSIS; QUERY LANGUAGES;

PRICED INFORMATION;

EID: 0033708135     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335382     Document Type: Conference Paper

References (18)

1. A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan and M. Sudan, "The minimum latency problem ," Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, 163-171.
2. A. Borodin, R. El-Yaniv, On-Line Computation and Competitive Analysis, Cambridge University Press, 1998.
3. B. Bollobas, Extremal Graph Theory, Academic Press, 1978.
4. Clickshare Service Corp., www.clickshare.com.
5. O. Etzioni, S. Hanks, T. Jiang, R.M. Karp, O. Madani, O. Waarts, "Efficient information gathering on the Interact ," Proc. IEEE FOCS 1996.
6. H. Garcia-Molina, S. Ketchpel, N. Shivakumar, " Safeguarding and Charging for Information on the Interact," Proc. Intl. Conf. on Data Engineering, 1998.
7. R. Heiman, A. Wigderson, " Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions," Complexity Theory, to appear.
8. J. Komlós, Y. Ma, E. Szemerédi, "Matching nuts and bolts in O(n log n) time ," Proc. ACM-SIAM SODA 1996.
9. E. Koutsoupias, C. Papadimitriou, M. Yannakakis, " Searching a fixed graph," Proc. Intl. Conf. on Automata, Languages, and Programming 1996.
10. D. Kreps, A Course in Micro-Economic Theory, Princeton University Press, 1990.
11. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
12. Pricing Economic Access to Knowledge (PEAK) Home Page, http://www.lib.umich.edu/libhome/peak/papers.html.
13. S. Sairamesh, C. Nikolaou, D. F. Ferguson and Y. Yemini. Economic Framework for Pricing and Charging in Digital Libraries. D-Lib Magazine, February 1996.
14. M. Saks, A. Wigderson, "Probabilistic Boolean decision trees and the complexity of evaluating game trees " Proc. IEEE FOCS, 1986.
15. M. Snir, "Lower bounds on probabilistic linear decision trees," Theoretical Computer Science 38(1985), pp. 69-82. (Pubitemid 15584051)
16. D. Tygar, " NetBill: An Internet Commerce System Optimized for Network-Delivered Systems" IEEE Personal Communications 2(1995), pp. 20-25.
17. "What's the Value of Digital Information? ", panel at ICEE Conf. on Electronic Commerce: Foundations for the Future, 1999.
18. Y. Zhang, " On the optimality of randomized alpha-beta search," SIAM Journal on Computing 24(1995), pp. 138-147.