Secure and verifiable schemes for election and general distributed computing problems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Finding pareto-optimal set of distributed vectors with minimum disclosure
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
Distributed methodologies to find pareto-optimal frontier with concern to privacy, of objectives and constraints, of parties is of interest in scenarios like negotiations. Adaptation of lagrangian method to solve distributed weighting method for both strictly concave and not strictly concave (e.g. linear) value functions is proposed for a maximization problem.