Dynamic programming-based strategy for automated trust negotiation
Xu Zhang · Journal of Computer Applications · 2008
Dynamic programming,an approach to solve the optimal question,was introduced into automated trust negotiation.The disclose cost was introduced to solve the problem of treating all credentials with the same sensitivity and the same format.A negotiation strategy modeled on AND/OR graph was proposed under the idea of dynamic programming to achieve the global optimization.The strategy achieved the minimal cost disclose sequence by traversing the AND/OR graph upward.The strategy is proved to be adoptable and efficient to ensure the safety and efficiency of the negotiation.