Using this framework, we developed a P program that solves the classical version of the Byzantine agreement problem, for N participants connected in a complete graph, according to the well known Byzantine agreement algorithm based on EIG trees.
A solution to our problem can be extended to solve the byzantine agreement problem in unknown fixed-identity networks.
It has been shown that any algorithm that solves the k-set agreement problem in synchronous systems that can suffer up to t crash failures requires ⌊tk⌋+1 rounds in the worst case.
Altaye et al. [36] give maximum likelihood estimates for relevant parameters in the fixed panel multi-rater agreement problem, although the computation of these maximum likelihood estimates is infeasible if the number of raters is large or if rating data are sparse.
The agreement's problem is that it bars not just class actions, but also all mechanisms many existing long before the Sherman Act, if that matters for joinder or consolidation of claims, informal coordination among individual claimants, or amelioration of arbitral expenses.
It is unknown whether or not the agreement supertree problem has the same property.
To our knowledge, there was no previous characterization of the agreement supertree problem for unrooted trees.
The agreement supertree problem asks if there exists a supertree for that agrees with all the trees in.
We also derived characterizations of the agreement supertree problem in terms of minimal cuts and minimal separators of the display and edge label intersection graphs respectively.
