Using GDL to Represent Domain Knowledge for Automated Negotiations

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 domain-independent, reasoning, negotiation algorithms.