Decentralized method for computing Pareto solutions in multiparty negotiations
From MaRDI portal
Publication:1806945
DOI10.1016/S0377-2217(98)00276-8zbMath0937.91016MaRDI QIDQ1806945
Publication date: 20 December 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cooperative games (91A12) Management decision making, including multiple objectives (90B50) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (7)
Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ A quantitative foundation for defining and manipulating deals to facilitate automated e-commerce ⋮ An intelligent agent negotiation strategy in the electronic marketplace environment ⋮ Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ Introducing multiobjective complex systems ⋮ Design of a decentralized framework for collaborative product design using memetic algorithms
Cites Work
- Theory of multiobjective optimization
- 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
- Co-oP. A group decision support system for cooperative multiple criteria group decision making
- Identifying Pareto-optimal settlements for two-party resource allocation negotiations
- Distributed computation of Pareto solutions in \(n\)-player games
- Proper efficiency and the theory of vector maximization
- Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods
- Negotiation Analysis: A Characterization and Review
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decentralized method for computing Pareto solutions in multiparty negotiations
