Advanced Search
MyIDEAS: Login

Agent-based approach to model parallel and concurrent negotiations

Contents:

Author Info

  • Adina Cretan

    ()
    (“Nicolae Titulescu” University of Bucharest, Romania)

  • Carlos Coutinho

    ()
    (Caixa Magica Software Lisboa, Portugal)

  • Ben Bratu

    ()
    (Extreme Computing R&D BULL Les Clayes-sous-Bois, France)

  • Ricardo Jardim-Goncalves

    ()
    (4CTS, Departamento de Engenharia Electrotecnica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, UNINOVA Portugal)

Registered author(s):

    Abstract

    Each organization has limited resources and in order to better accomplish a higher external demand, the managers are forced to outsource parts of their contracts even to concurrent organizations. In this concurrent environment each organization wants to preserve its decision autonomy and to disclose as little as possible from its business information. To model this interaction our approach is to define a framework for describing and managing parallel and concurrent negotiations among independent organizations acting in the same industrial market. The complexity of our negotiation model is done by the dynamic environment in which multi-attribute and multi-participant negotiations are racing over the same set of resources. We are using the metaphor Interaction Abstract Machines (IAMs) to model the parallelism and the non-deterministic aspects of our negotiation process.

    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://cmss.univnt.ro/wp-content/uploads/vol/split/vol_I_issue_I/02_Agent-based_approach_to_model_parallel_and_concurrent_negotiations.pdf
    File Function: First version, 2013
    Download Restriction: no

    Bibliographic Info

    Article provided by "Nicolae Titulescu" University of Bucharest, Faculty of Economic Sciences in its journal Computational Methods in Social Sciences (CMSS).

    Volume (Year): 1 (2013)
    Issue (Month): 1 (Ianuary)
    Pages: 23-38

    as in new window
    Handle: RePEc:ntu:ntcmss:vol1-iss1-13-23

    Contact details of provider:
    Phone: +040.21.330.90.32
    Fax: +040.21.330.86.08
    Email:
    Web page: http://www.univnt.ro/
    More information through EDIRC

    Related research

    Keywords: Negotiation model; intelligent agents; computational method; dynamic environment; constraint satisfaction programming;

    References

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

    Citations

    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:ntu:ntcmss:vol1-iss1-13-23. 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: (Stefan Ciucu).

    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.