Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods
This paper presents a class of methods, called constraint proposal methods, for generating Pareto-optimal solutions in two-party negotiations. In these methods joint tangents of the decision makers' value functions are searched by adjusting an artificial plane constraint. The problem of generating Pareto-optimal solutions decomposes into ordinary multiple criteria decision-making problems for the individual decision makers and into a coordination problem for an assisting mediator. Depending on the numerical iteration scheme used to solve the coordination problem, different constraint proposal methods are obtained. We analyze and illustrate the behaviour of some iteration schemes by numerical examples using both precise and imprecise answers from decision makers. An example of a method belonging to the class under study is the RAMONA method, that has been previously described from a practical point of view. We present the underlying theory for it by describing it as a constraint proposal method, and include some applications.
Volume (Year): 45 (1999)
Issue (Month): 12 (December)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- James K. Sebenius, 1992. "Negotiation Analysis: A Characterization and Review," Management Science, INFORMS, vol. 38(1), pages 18-38, January.
- Osborne, Dale K, 1976. "Cartel Problems," American Economic Review, American Economic Association, vol. 66(5), pages 835-44, December.
- Teich, Jeffrey E. & Wallenius, Hannele & Kuula, Markku & Zionts, Stanley, 1995. "A decision support approach for negotiation with an application to agricultural income policy negotiations," European Journal of Operational Research, Elsevier, vol. 81(1), pages 76-87, February.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:12:p:1697-1709. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.