Please use this identifier to cite or link to this item:
|Title:||Kemnad : a knowledge engineering methodology for negotiating agent development||Authors:||Luo, Xudong
Jennings, Nicholas R.
Miao, Chun Yan
|Issue Date:||2012||Source:||Luo, X., Miao, C., Jennings, N. R., He, M., Shen, Z.,& Zhang, M. (2012). KEMNAD: A KNOWLEDGE ENGINEERING METHODOLOGY FOR NEGOTIATING AGENT DEVELOPMENT. Computational Intelligence, 28(1), 51-105.||Series/Report no.:||Computational intelligence||Abstract:||Automated negotiation is widely applied in various domains. However, the development of such systems is a complex knowledge and software engineering task. So, a methodology there will be helpful. Unfortunately, none of existing methodologies can offer sufficient, detailed support for such system development. To remove this limitation, this paper develops a new methodology made up of (1) a generic framework (architectural pattern) for the main task, and (2) a library of modular and reusable design pattern (templates) of subtasks. Thus, it is much easier to build a negotiating agent by assembling these standardized components rather than reinventing the wheel each time. Moreover, because these patterns are identified from a wide variety of existing negotiating agents (especially high impact ones), they can also improve the quality of the final systems developed. In addition, our methodology reveals what types of domain knowledge need to be input into the negotiating agents. This in turn provides a basis for developing techniques to acquire the domain knowledge from human users. This is important because negotiation agents act faithfully on the behalf of their human users and thus the relevant domain knowledge must be acquired from the human users. Finally, our methodology is validated with one high impact system.||URI:||https://hdl.handle.net/10356/96841
|DOI:||10.1111/j.1467-8640.2012.00409.x||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.