A new strategy for querying priced information

DOI10.1145/1060590.1060691zbMath1192.68948OpenAlexW1986302927MaRDI QIDQ3581410

Ferdinando Cicalese, Eduardo Sany Laber

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060691

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Information storage and retrieval of data (68P20)

Related Items (6)

The hardness of the expected decision depth problem ⋮ A note on the size of minimal covers ⋮ Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Competitive evaluation of threshold functions in the priced information model ⋮ Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case ⋮ Sorting and Selection with Random Costs

This page was built for publication: A new strategy for querying priced information