Recently, it has been proposed that Game Description Language (GDL) could be used to define negotiation domains. This would open up an entirely new, declarative, approach to Automated Negotiations in which a single algorithm could negotiate over any domain, as long as that domain is expressible in GDL. However, until now, the feasibility of this approach has only been demonstrated on a few toy-world problems. Therefore, in this paper we show that GDL is a truly unifying language that can also be used to define more general and more complex negotiation domains. We demonstrate this by showing that some of the most commonly used test-beds in the Automated Negotiations literature, namely Genius and Colored Trails, can be described in GDL. More specifically, 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. Furthermore, we show that this game can be effectively described in GDL and 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 holds for negotiation domains in the Colored Trails framework. This means that one could indeed implement a single negotiating agent that is capable of negotiating over a broad class of negotiation domains, including Genius and Colored Trails.

近来，已经提出可以将游戏描述语言（GDL）用于定义协商域。这将打开一个全新的声明式一种自动协商的方法，其中单个算法可以在任何域上进行协商，只要该域在GDL中是可表示的即可。但是，直到现在，这种方法的可行性仅在玩具世界的一些问题上得到了证明。因此，在本文中，我们证明GDL是一种真正的统一语言，也可以用于定义更一般和更复杂的协商域。我们通过证明可以在GDL中描述“自动谈判”文献中最常用的一些试验台（即Genius和Coloured Trails）来证明这一点。更具体地说，我们正式证明，来自Genius的任何协商域（线性或非线性）的可能协议集可以建模为确定性扩展形式博弈的一组策略。此外，我们证明了该游戏可以在GDL中得到有效描述，并且通过实验表明，仅给出此GDL描述，我们就可以使用完全通用的领域独立算法来有效地探索协议空间。此外，我们表明，Colored Trails框架中的协商域也是如此。这意味着一个人确实可以实现一个能够在广泛的谈判领域（包括Genius和Colored Trails）上进行谈判的单一谈判代理。