Generating Pareto solutions in a two-party setting: constraint proposal methods
From MaRDI portal
Recommendations
- Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method
- Constraint proposal method for computing Pareto solutions in multi-party negotiations
- Analysis of the constraint proposal method for two-party negotiations
- Decentralized method for computing Pareto solutions in multiparty negotiations
- Searching for joint gains in multi-party negotiations.
Cited in
(10)- Adjustment of an affine contract with a fixed-point iteration
- Identifying Pareto-optimal settlements for two-party resource allocation negotiations
- Decentralized method for computing Pareto solutions in multiparty negotiations
- Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation
- Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach
- Searching for joint gains in multi-party negotiations.
- Constraint proposal method for computing Pareto solutions in multi-party negotiations
- A simultaneous multi-issue negotiation through autonomous agents
- Analysis of the constraint proposal method for two-party negotiations
This page was built for publication: Generating Pareto solutions in a two-party setting: constraint proposal methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116713)