Reference : Argumentative Agents Negotiating on Potential Attacks
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/24953
Argumentative Agents Negotiating on Potential Attacks
English
Boella, Guido [> >]
Gabbay, Dov M. [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Perotti, Alan [> >]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Villata, Serena [> >]
2011
KES-AMSTA
Springer
Lecture Notes in Computer Science 6682
280–290
Yes
International
978-3-642-21999-3
KES-AMSTA
2011
[en] Argumentative Agents ; Negotiating ; Potential Attack
[en] When arguing, agents may want to discuss about the details after agreeing about the general problems. We propose to model this kind of situation using an extended argumentation framework with potential attacks. Agents negotiation about raising potential attacks or not, in order to maximize the number of their accepted arguments. The result of the negotiation process consists in the formation of coalitions composed by those agents which have found an agreement. The two proposed negotiation protocols have been implemented and an evaluation, addressed by means of experimental results, shows which combination of strategies and negotiation protocol allows the agents to optimize outcomes.
Researchers ; Professionals ; Students ; General public ; Others
http://hdl.handle.net/10993/24953
10.1007/978-3-642-22000-5\_30
http://link.springer.com/chapter/10.1007%2F978-3-642-22000-5_30
The original publication is available at http://link.springer.com/
6682

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
blank.pdfPublisher postprint10.85 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.