Decentralized method for computing Pareto solutions in multiparty negotiations

Article Abstract:

A decentralized technique for calculating Pareto-optimal solutions in multiparty negotiations over continuous issues is proposed. The technique is based on the well-known weighting method, which is decomposed by introducing an own decision variable for each decision maker and by using the dual decomposition technique on the resulting problem. The technique affords a systematic way for obtaining some or all Pareto-optimal solutions so that decision makers need not know each others' valu functions.

Author: Heiskanen, Pirjas
Multiple criteria decision making, Usage, Optimization theory, Mathematical programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory

Article Abstract:

The connection between social choice theory and the problem of aggregating beliefs provided by different agents in a negotiation procedure is examined. The relation between majority operators and arbitration operators is studied and the results are presented.

Author: Konieczny, Sebastien, Perez, Ramon Pino
Social choice

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Propositional distances and compact preference representation

Article Abstract:

A logical model for representing choice of a distance between worlds, based on Choquet propositional distances, is presented

Author: Lafage, Celine, Lang, Jerome
Science & research, Distances, Distance (Geometry), Proposition (Logic)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Analysis, Negotiation, Negotiations, Methods, United States
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.