Computerised contract negotiation</tile> <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> <meta http-equiv="description" content="Computerised contract negotiation"> <meta http-equiv="keywords" content="Computerised,contract,negotiation"> </head> <body> <table width="100%" border="0" cellspacing="0" cellpadding="0"> <tr> <td width="10" height="39"> </td> <td width="99%" height="39"> <table width="100%" border="0" cellspacing="0" cellpadding="0"> <tr> <td width="16%"><a href="http://inttranews.inttra.net"><img src="http://inttranews.inttra.net/images/inttranews_grey_2.jpg" width="192" height="37" border="0"></a></td> <td width="50%" valign="middle"> <p><font face="Arial, Helvetica, sans-serif" size="2"><b><font color="#CCCCCC" face="Verdana, Arial, Helvetica, sans-serif" size="1">KNOW.<br> HOW.</font></b></font> </p> </td> <td width="34%" align="right" valign="top"><font face="Verdana, Arial, Helvetica, sans-serif" size="1" color="#666666">11-04-2005</font></td> </tr> </table> </td> </tr> <tr> <td width="10"> </td> <td width="99%" > </td> </tr> <tr> <td width="10"> </td> <td width="99%" > <table width="100%" border="0" cellspacing="0" cellpadding="0"> <tr> <td width="100%"><font face="Verdana, Arial, Helvetica, sans-serif" size="2"> <b>Computerised contract negotiation</b></font> </td> </tr> <tr> <td width="100%"> </td> </tr> <tr> <td width="100%"> <font face="Verdana, Arial, Helvetica, sans-serif" size="2">Washington, USA [ScienceDirect (registration required)]: The use of software agents for automatic contract negotiation in e-commerce and e-trading environments has been the subject of considerable recent interest. A widely studied abstract model considers the setting in which a set of agents have some collection of resources shared out between them and attempt to construct a mutually beneficial optimal reallocation of these by trading resources. The simplest such trades are those in which a single agent transfers exactly one resource to another—so-called ‘one-resource-at-a-time’ or ‘O-contracts’. In this research note the authors consider the computational complexity of a number of natural decision problems in this setting. <br> <br>For more information, please visit: <br><a href="http://www.sciencedirect.com/science?_ob=GatewayURL&_method=citationSearch&_urlVersion=4&_origin=SDVIALERTHTML&_version=1&_uoikey=B6TYF-4FPJB36-3&md5=0a5583d4d818e4f34ae3c49662e6f4ac " target="blank">www.sciencedirect.com/science?_ob=GatewayURL&_method=citationSearch&_urlVersion=4&_origin=SDVIALERTHTML&_version=1&_uoikey=B6TYF-4FPJB36-3&md5=0a5583d4d818e4f34ae3c49662e6f4ac </a> <br></font></td> </tr> </table> </td></tr> </table> <script type="text/javascript"></script> <script type="text/javascript" src="<http://pagead2.googlesyndication.com/pagead/show