Some extremal problems arising from discrete control processes |
| |
Authors: | D. Lichtenstein N. Linial M. Saks |
| |
Affiliation: | (1) Bell Laboratories, 07733 Holmdel, NJ, USA;(2) Department of Computer Science, Hebrew University, Givat Ram, Jerusalem, Israel;(3) Department of Computer Science and Engineering, University of California at San Diego, 92122 La Jolla, Calif., USA |
| |
Abstract: | We consider a simple abstract model for a class of discrete control processes, motivated in part by recent work about the behavior of imperfect random sources in computer algorithms. The process produces a string ofn bits and is a “success” or “failure” depending on whether the string produced belongs to a prespecified setL. In an uninfluenced process each bit is chosen by a fair coin toss, and hence the probability of success is ¦L¦/2 n . A player called the controller, is introduced who has the ability to intervene in the process by specifying the value of some of the bits of the string. We answer the following questions for both worst and average case: (1) how much can the player increase the probability of success given a fixed number of interventions? (2) in terms of ¦L¦what is the expected number of interventions needed to guarantee success? In particular our results imply that if ¦L¦/2 n =1/Ω(n) where Ω(n) tends to infinity withn (so the probability of success with no interventions is 0(1)) then withO(√n logΩ(n)) interventions the probability of success is 1?0(1). Our main results and the proof techniques are related to well-known results of Kruskal, Katona and Harper in extremal set theory. |
| |
Keywords: | 68 R 10 05 C 80 |
本文献已被 SpringerLink 等数据库收录! |
|