Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues and intractably large contract spaces. This talk will describe novel algorithms for meeting this challenge, as well as promising avenues for future work.
Last modified: Tuesday, 19-Mar-2013 09:37:44 NZDT
This page is maintained by the seminar list administrator.