Abstract
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.
The work is partly supported by the AICTE project ISISAMB.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Dordrecht (1999)
Heiskanen, P.: Decentralized method for computing pareto solutions in multiparty negotiations. European Journal of Operational Research 117, 578–590 (1999)
Goldreich, O.: Secure multi-party computation (working draft) Version 1.1 (1998), http://www.wisdom.weizmann.ac.il/~oded/pp.html (accessed on Febuary 10, 2004)
Huang, M.A., Teng, S.: Secure and verifiable schemes for election and general distributed computing problems. In: Seventh Annual ACM Symposium on Principles of Distributed Computing, pp. 182–196. ACM Press, New York (1988)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation, 2nd edn. Prentice–Hall International Editions, Englewood Cliffs (1989)
Sehgal, S.K., Pal, A.K.: A hybrid method to find pareto-optimal extreme points for linear optimization in multi-party negotiations. In: Thirteenth Workshop on Information Technology and Systems (WITS), Seattle, Washington, USA (2003)
Sehgal, S.K., Pal, A.K.: Finding pareto-optimal set of distributed vectors for negotiation with minimum disclosure. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds.) IWDC 2004. LNCS, vol. 3326, pp. 144–149. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sehgal, S.K., Pal, A.K. (2005). Privacy Preserving Decentralized Method for Computing a Pareto-Optimal Solution. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_66
Download citation
DOI: https://doi.org/10.1007/11603771_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)