Common use of Problem Description Clause in Contracts

Problem Description. ‌ In order to better motivate the generalization process that led to the design of protocol presented in this paper, let us introduce a model that we will show to encompass various practical problems, and an example situation for which solutions in literature (to the best of our knowledge) do not give satisfactory results. (i) Let N be a network, where each node i ∈ N has access to a Random Variable X , where X(i) = (X(i), . . . , X(i)), for all c ∈ {1, . . . , m}, where X(i) takes values in a discrete set V , P(i) 1 m c c c is its probability mass function, and X(i) = X(l), for all i, l ∈ N and for all c. Each node i . Σ c c records O(i) = x(i), . . . , x(i) , the observed values given by the random variable. The goal of 1 m our protocol is to allow the nodes in N to reach agreement on a vector of observed values. We make a distinction between two kind of components: ambiguous and unambiguous. A component c is ambiguous if there exist two honest nodes i, l ∈ N who observe two distinct values x(i) =ƒ x(l), otherwise we say that the component is unambiguous.