Advanced Search
MyIDEAS: Login

Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods

Contents:

Author Info

  • Harri Ehtamo

    (Systems Analysis Laboratory, Helsinki University of Technology, POB 1100, 02015 HUT, Finland)

  • Raimo P. Hämäläinen

    (Systems Analysis Laboratory, Helsinki University of Technology, POB 1100, 02015 HUT, Finland)

  • Pirja Heiskanen

    (Systems Analysis Laboratory, Helsinki University of Technology, POB 1100, 02015 HUT, Finland)

  • Jeffrey Teich

    (New Mexico State University, Las Cruces, New Mexico 88001)

  • Markku Verkama

    (Systems Analysis Laboratory, Helsinki University of Technology, POB 1100, 02015 HUT, Finland)

  • Stanley Zionts

    (State University of New York at Buffalo, Buffalo, New York 14260)

Registered author(s):

    Abstract

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.45.12.1697
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 45 (1999)
    Issue (Month): 12 (December)
    Pages: 1697-1709

    as in new window
    Handle: RePEc:inm:ormnsc:v:45:y:1999:i:12:p:1697-1709

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: negotiation analysis; Pareto optimality; joint problem solving; multiple criteria;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Heiskanen, Pirja & Ehtamo, Harri & Hamalainen, Raimo P., 2001. "Constraint proposal method for computing Pareto solutions in multi-party negotiations," European Journal of Operational Research, Elsevier, vol. 133(1), pages 44-61, August.
    2. Zhang, Linlan & Song, Haigang & Chen, Xueguang & Hong, Liu, 2011. "A simultaneous multi-issue negotiation through autonomous agents," European Journal of Operational Research, Elsevier, vol. 210(1), pages 95-105, April.
    3. Ehtamo, Harri & Kettunen, Eero & Hamalainen, Raimo P., 2001. "Searching for joint gains in multi-party negotiations," European Journal of Operational Research, Elsevier, vol. 130(1), pages 54-69, April.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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.