Analysis of the constraint proposal method for two-party negotiations

DOI10.1016/j.ejor.2006.07.002zbMath1131.91311OpenAlexW2119324303MaRDI QIDQ877065

Harri Ehtamo, Mitri Kitti

Publication date: 19 April 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.002

zbMATH Keywords

fixed-point iterationPareto optimalityexistence of solutiongroup decisions and negotiationsnegotiation support method

Mathematics Subject Classification ID

Decision theory (91B06) Decision theory for games (91A35)

Related Items

Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation, Adjustment of an affine contract with a fixed-point iteration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• A decision support approach for negotiation with an application to agricultural income policy negotiations
• Identifying Pareto-optimal settlements for two-party resource allocation negotiations
• Distributed computation of Pareto solutions in \(n\)-player games
• A cooperative incentive equilibrium for a resource management problem
• Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method
• The Bargaining Problem
• 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