Common Contracts
1 similar null contracts
PDF hosted at the Radboud Repository of the Radboud University NijmegenOctober 23rd, 2017
Decision Trees. The interaction between a game G and a deterministic adver- sary A can be viewed as a decision tree as follows. The adversary produces a first input x1 X to the oracle O, which represents the root of the tree. The oracle produces an output y1 Y, and depending upon the output, A decides its next oracle input. Each of the possible oracle outputs y1 Y results in an edge extending from the root to a child node, which contains A’s second oracle query, assuming (x1, y1) has occurred. Then, starting from a child node, we extend the tree further by adding edges according to the second oracle output, connecting them to the third oracle inputs. Without loss of generality, we may restrict our- selves to decision trees where each edge has a non-zero chance of occurring: if the output y1 is not possible with input x1, then we do not include that edge in the tree.
