Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method

DOI10.1002/nav.3zbMath1130.91323OpenAlexW2067783041MaRDI QIDQ2741216

Pirja Heiskanen

Publication date: 9 September 2001

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Voting theory (91B12)

Related Items (2)

Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ Analysis of the constraint proposal method for two-party negotiations

Cites Work

• Unnamed Item
• A decision support approach for negotiation with an application to agricultural income policy negotiations
• Identifying Pareto-optimal settlements for two-party resource allocation negotiations
• Decentralized method for computing Pareto solutions in multiparty negotiations
• Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods
• Searching for joint gains in multi-party negotiations.
• Constraint proposal method for computing Pareto solutions in multi-party negotiations

This page was built for publication: Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method