IDEAS home Printed from https://ideas.repec.org/a/spr/grdene/v20y2011i4d10.1007_s10726-009-9163-0.html
   My bibliography  Save this article

An Argumentation-Driven Model for Flexible and Efficient Persuasive Negotiation

Author

Listed:
  • Jamal Bentahar

    (Concordia University)

  • Jihad Labban

    (Concordia University)

Abstract

The purpose of this paper is to propose a formal description and implementation of a negotiation protocol between autonomous agents using persuasive argumentation. This protocol is designed to be simple and computationally efficient. The computational efficiency is achieved by specifying the protocol as a set of simple logical rules that software agents can easily combine. These latter are specified as a set of computational dialogue games about which agents can reason. The protocol converges by checking the termination conditions. The paper discusses the formal properties of the protocol and addresses, as proof of concept, the implementation issues using an agent-oriented platform equipped with logical programming mechanisms.

Suggested Citation

  • Jamal Bentahar & Jihad Labban, 2011. "An Argumentation-Driven Model for Flexible and Efficient Persuasive Negotiation," Group Decision and Negotiation, Springer, vol. 20(4), pages 411-435, July.
  • Handle: RePEc:spr:grdene:v:20:y:2011:i:4:d:10.1007_s10726-009-9163-0
    DOI: 10.1007/s10726-009-9163-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10726-009-9163-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10726-009-9163-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Elhadi Shakshuki & André Trudel & Yiqing Xu, 2007. "A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 2(2), pages 45-64, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Gianvincenzo Alfano & Sergio Greco & Francesco Parisi, 2019. "An Incremental Algorithm for Computing the Grounded Extension of Dynamic Abstract Argumentation Frameworks," Group Decision and Negotiation, Springer, vol. 28(5), pages 935-960, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:grdene:v:20:y:2011:i:4:d:10.1007_s10726-009-9163-0. See general information about how to correct material in RePEc.

      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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.