Competitive evaluation of threshold functions in the priced information model
From MaRDI portal
(Redirected from Publication:646704)
Recommendations
Cites work
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- A new strategy for querying priced information
- Algorithms – ESA 2005
- Artificial intelligence and Mathematics IX. Selected papers from the 5th international symposium, Fort Lauderdale, FL, USA, January 2--5, 1998
- Combinatorial characterization of read-once formulae
- Discrete mathematics of neural networks. Selected topics
- Disjoint Products and Efficient Computation of Reliability
- Function Evaluation Via Linear Programming in the Priced Information Model
- Geometric algorithms and combinatorial optimization
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3278279 (Why is no real title available?)
- On read-once threshold formulae and their randomized decision tree complexity
- On the competitive ratio of evaluating priced functions
- Query strategies for priced information
Cited in
(5)- Threshold tests as quality signals: optimal strategies, equilibria, and Price of anarchy
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Function Evaluation Via Linear Programming in the Priced Information Model
- Directed projection graph of \(N\)-dimensional hypercube and subhypercube decomposition of balanced linearly separable Boolean functions
- On the competitive ratio of evaluating priced functions
This page was built for publication: Competitive evaluation of threshold functions in the priced information model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646704)
