GDL as a unifying domain description language for declarative automated negotiation

We show that Game Description Language (GDL) can be used to describe some of the most commonly used test-beds in the automated negotiations literature, namely Genius and Colored Trails. This opens up an entirely new, declarative, approach to automated negotiation, in which a single algorithm can negotiate over a very broad class of different negotiation domains. We formally prove that the set of possible agreements of any negotiation domain from Genius (either linear or non-linear) can be modeled as a set of strategies over a deterministic extensive-form game that can be described efficiently in GDL. Furthermore, we show experimentally that, given only this GDL description, we can explore the agreement space efficiently using entirely generic domain-independent algorithms. In addition, we show that the same also holds for negotiation domains in the Colored Trails framework. This means we have the basic ingredients to implement a single negotiating agent that is capable of negotiating over many different kinds of negotiation domains, including Genius and Colored Trails.