Finding pareto-optimal set of distributed vectors with minimum disclosure

被引：0
|
作者：
Sehgal, SK [1 ]
Pal, AK [1 ]
机构：
[1] Indian Inst Management, Kolkata 700027, W Bengal, India
来源：
DISTRIBUTED COMPUTING - IWDC 2004, PROCEEDINGS | 2004年 / 3326卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A set of alternatives along with their associated values is available with individual parties who do not want to share it with others. Algorithms to find the feasible set (i.e. common subset) X and the pareto-optimal subset of X with minimum disclosure in presence or absence of a third party are explored. These are useful in multiparty negotiations.
引用
收藏
页码：144 / 149
页数：6
相关论文
共 50 条
  • [1] On finding dissimilar Pareto-Optimal paths
    Dell'Olmo, P
    Gentili, M
    Scozzari, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (01) : 70 - 82
  • [2] A Multiobjective Approach for Finding Equivalent Inverse Images of Pareto-optimal Objective Vectors
    Rudolph, Guenter
    Preuss, Mike
    [J]. MCDM: 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION-MAKING, 2009, : 74 - 79
  • [3] APPROXIMATION OF A SET OF PARETO-OPTIMAL SOLUTIONS
    NEFEDOV, VN
    [J]. USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1986, 26 (01): : 99 - 107
  • [4] Modified algorithm to compute Pareto-optimal vectors
    Sastry, VN
    Mohideen, SI
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 103 (01) : 241 - 244
  • [5] Modified Algorithm to Compute Pareto-Optimal Vectors
    V. N. Sastry
    S. Ismail Mohideen
    [J]. Journal of Optimization Theory and Applications, 1999, 103 : 241 - 244
  • [6] Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls
    Siegmund, Florian
    Ng, Amos H. C.
    Deb, Kalyanmoy
    [J]. 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [7] A Distributed Pareto-Optimal Dynamic Estimation Method
    Boem, Francesca
    Xu, Yuzhe
    Fischione, Carlo
    Parisini, Thomas
    [J]. 2015 EUROPEAN CONTROL CONFERENCE (ECC), 2015, : 3673 - 3680
  • [8] On finding an envy-free Pareto-optimal division
    Reijnierse, JH
    Potters, JAM
    [J]. MATHEMATICAL PROGRAMMING, 1998, 83 (02) : 291 - 311
  • [9] On finding an envy-free Pareto-optimal division
    J. H. Reijnierse
    J. A. M. Potters
    [J]. Mathematical Programming, 1998, 83 : 291 - 311
  • [10] Finding pareto-optimal set by merging attractors for a bi-objective traveling salesmen problem
    Li, WQ
    [J]. EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2005, 3410 : 797 - 810
12345