Query strategies for priced information (extended abstract)

DOI10.1145/335305.335382zbMath1296.68075OpenAlexW1971849893MaRDI QIDQ3192028

Ronald Fagin, Amit Sahai, Prabhakar Raghavan, Jon M. Kleinberg, Moses Charikar, Venkatesan Guruswami

Publication date: 26 September 2014

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Computing similarity distances between rankings

This page was built for publication: Query strategies for priced information (extended abstract)