Competitive learning of monotone Boolean functions
  We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances. 
Sascha Kurz
cs.DS cs.CC math.OC