| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To obtain an optimal solution while keeping the weight of a link secret and to apply to the optimal solution to a bidding method for a plurality of properties, for instance. <P>SOLUTION: An issuer corresponding to each link makes the weight w (j, k) as degrees, substitues x<SB>q</SB>(q=1,..., e) for a polynomial W<SB>j</SB>,<SB>k</SB>(x) of W<SB>j</SB>,<SB>k</SB>(0)=c and secretly disperses W<SB>j</SB>,<SB>k</SB>(x<SB>q</SB>) to a corresponding evaluator E<SB>q</SB>. The E<SB>q</SB>determines sum of productsΣ<SB>(j</SB>,<SB>k)</SB>W<SB>j</SB>,<SB>k</SB>(x<SB>q</SB>).F<SB>k</SB>(x<SB>q</SB>)≡F<SB>j</SB>(x<SB>q</SB>) of W<SB>j</SB>,<SB>k</SB>(x<SB>q</SB>) of all links on a terminal end side connected to node j and a secret dispersion part optimal value F<SB>k</SB>(x<SB>q</SB>) up to node k. The degrees of each polynomial ofΣ<SB>(j</SB>,<SB>k)</SB>W<SB>j</SB>,<SB>k</SB>(x). F<SB>k</SB>(x)≡F<SB>j</SB>(x) are in the relation of max<SB>(j</SB>,<SB>k)</SB>(w(j,k)+f(k))=f(j). F<SB>0</SB>(x<SB>q</SB>) is therefore determined by making a recurrence formula of the sum of products calculation as F<SB>m</SB>(X<SB>q</SB>)=1. A dispersion value M(x<SB>q</SB>) of a degree d and a mask polynomial M(x) of M(0)=0 is added to F<SB>0</SB>(x<SB>q</SB>), the addition values are collected from each E<SB>q</SB>to restore F<SB>0</SB>(0)+M(0), and whether or not the degree of F<SB>0</SB>(x) is below d is investigated. The degree of F<SB>0</SB>(x) is determined by a binary searching method to obtain the optimal solution f(0). <P>COPYRIGHT: (C)2003,JPO</p> |
