Constraint proposal method for computing Pareto solutions in multi-party negotiations
From MaRDI portal
Publication:5943557
DOI10.1016/S0377-2217(00)00179-XzbMath0989.90082MaRDI QIDQ5943557
Harri Ehtamo, Pirja Heiskanen, Raimo P. Hämäläinen
Publication date: 8 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)
Related Items (9)
Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ Analysis of the constraint proposal method for two-party negotiations ⋮ Automated Multilateral Negotiation on Multiple Issues with Private Information ⋮ An intelligent agent negotiation strategy in the electronic marketplace environment ⋮ Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method ⋮ Introducing multiobjective complex systems ⋮ A formal analysis of interest-based negotiation ⋮ A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments ⋮ Design of a decentralized framework for collaborative product design using memetic algorithms
Cites Work
- Theory of multiobjective optimization
- A decision support approach for negotiation with an application to agricultural income policy negotiations
- Identifying Pareto-optimal settlements for two-party resource allocation negotiations
- Nonlinear multiobjective optimization
- Distributed computation of Pareto solutions in \(n\)-player games
- Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods
- Negotiation Analysis: A Characterization and Review
- Convex Analysis
- Searching for joint gains in multi-party negotiations.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constraint proposal method for computing Pareto solutions in multi-party negotiations
