Abstract
Current negotiation algorithms often assume that utility has an explicit representation as a function over the set of possible deals and that for any deal its utility value can be calculated easily. We argue however, that a more realistic model of negotiations would be one in which the negotiator has certain knowledge about the domain and must reason with this knowledge in order to determine the value of a deal, which is time-consuming.We propose to use Game Description Language to model such negotiation scenarios, because this may enable us to apply existing techniques from General Game Playing to implement domainindependent, reasoning, negotiation algorithms.
Author supplied keywords
Cite
CITATION STYLE
de Jonge, D., & Zhang, D. (2016). Using GDL to represent domain knowledge for automated negotiations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10003 LNAI, pp. 134–153). Springer Verlag. https://doi.org/10.1007/978-3-319-46840-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
