<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JSEA</journal-id><journal-title-group><journal-title>Journal of Software Engineering and Applications</journal-title></journal-title-group><issn pub-type="epub">1945-3116</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jsea.2015.810049</article-id><article-id pub-id-type="publisher-id">JSEA-60210</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  An E-Negotiation Agent Using Rule Based and Case Based Approaches: A Comparative Study with Bilateral E-Negotiation with Prediction
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>heetal</surname><given-names>R. Vij</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Amruta</surname><given-names>More</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Debajyoti</surname><given-names>Mukhopadhyay</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Avinash</surname><given-names>J. Agrawal</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Computer Engineering, Maharashtra Institute of Technology, Pune, India</addr-line></aff><aff id="aff3"><addr-line>Department of Computer Science and Engineering, Ramdeobaba College of Engineering and Management, Nagpur, India</addr-line></aff><aff id="aff2"><addr-line>Department of Information Technology, Maharashtra Institute of Technology, Pune, India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>sheetal.sh@gmail.com(HRV)</email>;<email>moreamruta930@gmail.com(AM)</email>;<email>debajyoti.mukhopadhyay@gmail.com(DM)</email>;<email>agrawalaj@rknec.edu(AJA)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>12</day><month>10</month><year>2015</year></pub-date><volume>08</volume><issue>10</issue><fpage>521</fpage><lpage>530</lpage><history><date date-type="received"><day>20</day>	<month>August</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>9</month>	<year>October</year>	</date><date date-type="accepted"><day>12</day>	<month>October</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The research in the area of automated negotiation systems is going on in many universities. This research is mainly focused on making a practically feasible, faster and reliable E-negotiation system. The ongoing work in this area is happening in the laboratories of the universities mainly for training and research purpose. There are number of negotiation systems such as Henry, Kasbaah, Bazaar, Auction Bot, Inspire, and Magnet. Our research is based on making an agent software for E-negotiation which will give faster results and also is secure and flexible. The negotiation partners and contents between the service providers change frequently. The negotiation process can be transformed into rules and cases. Using these features, a new automated negotiation model for agent integrating rule based and case based reasoning can be derived. We propose an E-negotiation system, in which all product information and multiple agent details are stored on the cloud. An E-negotiation agent acts as a negotiator. Agent has user’s details and their requirements for a particular product. It will check rules based data whether any rule is matching with the user requirement. An agent will see case based data to check any similar negotiation case matching to the user requirement. If a case matches with user requirement, then agent will start the negotiation process using case based data. If any rule related requirement is found in the rule base data, then agent will start the negotiation process using rule based data. If both rules based data and cases based data are not matching with the user requirement, then agent will start the negotiation process using Bilateral Negotiation model. After completing negotiation process, agent gives feedback to the user about whether negotiation is successful or not. The product details, rule based data, and case based data will be stored on the cloud. So that system automatically becomes flexible. We also compare E-negotiation agent automated negotiation and behavior prediction system to prove that using rule based and case based approaches system should become fast.
 
</p></abstract><kwd-group><kwd>Automated Negotiation</kwd><kwd> Multi-Agent</kwd><kwd> Rule Based Reasoning</kwd><kwd> Case Based Reasoning</kwd><kwd> Cloud Computing</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Practically “negotiation” can be defined as an iterative process which aims to achieve a mutually beneficial deal for the seller and buyer [<xref ref-type="bibr" rid="scirp.60210-ref1">1</xref>] . The automation saves human negotiation time and computational negotiators are better at finding deals in combinatorial and strategically complex settings. The rapid success of online auctions clearly shows that E-negotiation will eventually become the basis of e-commerce. Whether it is a case of B to B purchase or a case of online shopping, it is required to make the traditional negotiation pricing mechanism automated and intelligent [<xref ref-type="bibr" rid="scirp.60210-ref2">2</xref>] .</p><p>Cloud computing is innovation that uses advanced computational power and improved storage capabilities. Cloud computing is a new processing scheme in which computer processing is performed in the network. This means that users need not concern themselves with the processing details. Although Cloud computing enables more flexible, easier and faster computing [<xref ref-type="bibr" rid="scirp.60210-ref3">3</xref>] .</p><p>Case Based Reasoning (CBR) is a problem solving paradigm where the solution of new problem is based on solution of similar past problem. We use Rule Based Reasoning (RBR) concept, where there are some rules such as discount, festival offers etc.</p><p>In this system, we are introducing an E-negotiation agent based system using Rule Based Reasoning and Case Based Reasoning. Due to the use of Rule Based Reasoning and Case Based Reasoning, system becomes faster. In this system, all data that is product detail, case base data and rule base data are stored on cloud. Therefore system becomes flexible.</p></sec><sec id="s2"><title>2. Literature Review</title><p>In this section, we are presenting literature survey related to only rule based and case based reasoning. In our previous paper [<xref ref-type="bibr" rid="scirp.60210-ref4">4</xref>] , we have referred ten papers related to automated negotiation in the literature survey.</p><p>Liu Xiaowen and Yu Jin [<xref ref-type="bibr" rid="scirp.60210-ref5">5</xref>] introduced automated negotiation model for tourism industry. To improve the negotiation efficiency and success rate, this system proposed RBR and CBR. The model employs CBR method to support an automated negotiation by past successful negotiation cases used for those negotiation partners that have no contract rule existing in each other. This system does not support multi party multi issue negotiation.</p><p>Mohammad Irfan Bala, Sheetal Vij and Debajyoti Mukhopadhyay [<xref ref-type="bibr" rid="scirp.60210-ref6">6</xref>] introduced, E-negotiation system with behavior prediction. This work reviews the various methods used for predicting the opponent’s behavior and then proposes architecture for behavior prediction using artificial neural networks. It proposes the use of database for storing the results and suggests various issues that can be taken into consideration while predicting the opponent’s behavior.</p><p>Mira Vrbaski and Dorina Petriu [<xref ref-type="bibr" rid="scirp.60210-ref7">7</xref>] proposed Context-aware systems which use Rule Based Reasoning engines for decision making without involving explicit interaction with the user. It is difficult to rank suitable solutions based on unclear, qualitative criteria with a rule based approach, while rule based systems excel in filtering out unsuitable solutions based on clear criteria.</p><p>Leen-Kiat Soh and Costas Tsatsoulis [<xref ref-type="bibr" rid="scirp.60210-ref8">8</xref>] use Case Based Reasoning (CBR) and utility to learn, select, and apply negotiation strategies. Agent uses Case Based Reasoning (CBR) approach to solve new problem of negotiation strategy which based on previous similar past problem. Agent also learns from its previous negotiation experience.</p><p>P. Maes, R. Guttman, A. Moukas [<xref ref-type="bibr" rid="scirp.60210-ref9">9</xref>] introduced a Kasbah negotiation model. In this system, agents can only negotiate over the single issue of price. However, B2B negotiations often involve multiple issues. Moreover, the Kasbah agents can only act according to one of their pre-defined negotiation strategies which may not lead to the optimal negotiation results.</p><p>P. Wurman, M. Wellman, W. Walsh [<xref ref-type="bibr" rid="scirp.60210-ref10">10</xref>] introduced the Michigan AuctionBot is a general purposed Internet- based auction server hosted by the University of Michigan. Sellers can create new auctions on AuctionBot by choosing from a set of pre-defined auction types and then enter their specific auction parameters such as clearing time, minimum bid increment and whether proxy bids are allowed. E-bay is the example of AuctionBot negotiation system.</p><p>Some of above papers support multi party multi issue negotiation Rule Based Reasoning and Case Based Reasoning. Our negotiation system is a bilateral, muti-party, multi issue negotiation model. In this system, buyer and seller negotiate o multiple issues at a time and when both buyer and seller comes to final decision, then only negotiation process will be stopped.</p></sec><sec id="s3"><title>3. Proposed System</title><sec id="s3_1"><title>3.1. Problem Statement</title><p>For negotiation process, more than two parties come together to reach mutually beneficial outcome. For similar negotiation case, there is no need to do negotiation process again due to use of case based approach. We also provide some rules related to negotiation process which makes successful negotiation process. Due to use of rule based and case based approaches, negotiation system become faster. We also use Cloud computing concept, to store all organizations’ product data. Hence, maintenance of organizations’ data is reduced.</p></sec><sec id="s3_2"><title>3.2. Mathematical Model</title><p>The given mathematical model is for bilateral negotiations where an agent can negotiate about multiple issues. It also supports learning from the previous negotiation rounds. The mathematical model for the proposed work is as follows:</p><disp-formula id="scirp.60210-formula176"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x5.png"  xlink:type="simple"/></disp-formula><p>A: A is an agents which will participate in the negotiation.</p><p>U: The set of users that will participate in the negotiation. This set consists of both sellers and buyers.</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x6.png" xlink:type="simple"/></inline-formula>represents m number of users.</p><p>R: The set of requirement which are given by users to their respective agents. This set consists of both sides’ seller side and buyer side requirements.</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x7.png" xlink:type="simple"/></inline-formula>represents i number of requirements that is “R” represents total number of requirements which are available at current stage.</p><p>D: The set of database which is used for matching the users’ requirement with rule based and case based databases.</p><p>T: The time limit for the negation.</p><p>Whole process of negotiation should complete before the time limit.</p><p>Constrains:</p><p>In previous we can use R for set of requirements but requirement of particular user is become a constrain.</p><p>Algorithms:</p><p>A<sub>1</sub> = A single user gives his requirements to respective agent.</p><disp-formula id="scirp.60210-formula177"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x8.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.60210-formula178"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x9.png"  xlink:type="simple"/></disp-formula><p>Here, mapping of R<sub>1</sub> to R, U<sub>1</sub> to U.</p><p>A<sub>2</sub> = Agent checks the user requirements with rule based and case based databases</p><p>A<sub>3</sub> = After checking databases, agent will start actual negotiation process.</p><p>A<sub>4</sub> = Total time of negotiation process should be less than or equal to T.</p><disp-formula id="scirp.60210-formula179"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x10.png"  xlink:type="simple"/></disp-formula><p>where, N<sub>time</sub> is the total time of negotiation process.</p><p>Flow diagram of mathematical model is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p></sec></sec><sec id="s4"><title>4. System Architecture</title><p>The architecture of E-negotiation agent system is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p><p>Working of E-negotiation agent system:</p><p>1) Databases on cloud</p><p>・ Product detail: used to store organizations’ product detail like product name, price, quantity;</p><p>・ Case base: used to store experience of agent about negotiation process;</p><p>・ Rule base: used to store rules related to product like discount, festival offers.</p><p>2) Seller and Buyer: Users of the system</p><p>3) Agent: An agent acts as a negotiator</p><p>Negotiation Process: After receiving Seller’s and Buyer’s requirement, agent will start negotiation process. For negotiation process, agent will check three conditions.</p><p>・ Case based: An agent will see case based data to check any similar negotiation case is matching to the user requirement. If a case matches with user requirement, then agent start the negotiation process using case based data.</p><p>・ Rule based: It will check rules based data whether any rule is matching with the user requirement. If any rule related requirement is found in the rule base data, then agent will start the negotiation process using rule based data.</p><p>・ Bilateral Negotiation model: If both rules based data and case based data are not matching with the user requirement, then agent will start the negotiation process using Bilateral Negotiation model.</p><p>4) Feedback: After completing negotiation process, agent gives feedback to the user about whether negotiation is successful or not.</p><p>Flow chart of E-negotiation agent system is shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Flow diagram of mathematical model of E-negotiation agent system</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x11.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> System architecture of E-negotiation agent system</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x12.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Flow chat of E-negotiation agent system</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x13.png"/></fig>Components of the System<p>For this system, we can use three components. Using these components, system becomes easy to use and work efficiently.</p><p>1) Store data on cloud: For storing data, we can use Open Stack cloud. Open Stack is a Cloud computing project to provide an IaaS. It is free open source software released under the terms of the Apache License.</p><p>In this module, all data which is required for negotiation process like product data, rule base data and case base data is stored on cloud.</p><p>2) Negotiation process: For negotiation process [<xref ref-type="bibr" rid="scirp.60210-ref4">4</xref>] , seller and buyer give their requirements to agent in encrypted format that is generate the hash code of that requirement and encrypt that hash code using user’s public key. User’s public key is known to Agents.</p><disp-formula id="scirp.60210-formula180"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x14.png"  xlink:type="simple"/></disp-formula><p>where, for generating hash function MD5 algorithm is used.</p><p>U<sub>pk</sub> is user’s public key.</p><p>We can use encryption for security purpose, in this process, we can use digital signature concept.</p><p>Same as seller, buyer can do same process for generating hash code of his requirement.</p><p>After getting requirement, agent decrypt the hash code using his private key and calculate the hash code for checking whether this message comes from appropriate seller or buyer and whether it is modified or not.</p><disp-formula id="scirp.60210-formula181"><graphic  xlink:href="http://html.scirp.org/file/1-9302101x15.png"  xlink:type="simple"/></disp-formula><p>where, A<sub>pri</sub> is agent’s private key.</p><p>After getting the requirement, agent checks the user requirements whether any rule related to requirement is found in the rule base data then only agent will start the negotiation process using decision function [<xref ref-type="bibr" rid="scirp.60210-ref11">11</xref>] .</p><p>・ Decision Function: After getting the requirement, agent checks the user requirements whether any rule related to requirement is found in the rule base data then only agent will start the negotiation process using decision function. The negotiation .model introduces a decision function [<xref ref-type="bibr" rid="scirp.60210-ref11">11</xref>] for supplier and buyer first. Seller’s agent responds at t<sub>n</sub> to buyer’s agent offer sent at time t<sub>n</sub><sub>-1</sub> and total profit is defined as Equation (1). Similarly, buyer’s agent also has a decision function to respond at t<sub>n</sub> to seller’s agent offer sent at time t<sub>n</sub><sub>-1</sub> and total cost is shown in Equation (2).</p><disp-formula id="scirp.60210-formula182"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-9302101x16.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.60210-formula183"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-9302101x17.png"  xlink:type="simple"/></disp-formula><p>The buyer uses Equation (2) to decide whether he should accept suppliers’ proposal or not. Similarly, using a decision function Equation (1) a supplier can make decision.</p><p>・ Bilateral Negotiation model: If both rules based data and case based data are not matching with the user requirement, then Buyer’s agent and Seller’s agent will start the negotiation process with each other using Bilateral Negotiation model.</p><p>For negotiation process, we can use the Bilateral Negotiation model [<xref ref-type="bibr" rid="scirp.60210-ref12">12</xref>] .</p><p>Let x represents the buyer agent <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x18.png" xlink:type="simple"/></inline-formula> and y <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x19.png" xlink:type="simple"/></inline-formula> be the supplier agent. And let then i <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x20.png" xlink:type="simple"/></inline-formula> be the issues under negotiation, such as price, volume, duration, quality and so</p><p>on. Each agent assigns to each issue i a weight W<sub>i</sub>, denoting the relative importance of that issue to the agent. Here, we consider quality as a weight. Hence, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x21.png" xlink:type="simple"/></inline-formula>represents the importance of issue i to agent x, therefore the overall utility function of an offer O is</p><disp-formula id="scirp.60210-formula184"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-9302101x23.png"  xlink:type="simple"/></disp-formula><p>where the overall utility is denoted as U(O) for the offer<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x24.png" xlink:type="simple"/></inline-formula>, and u<sub>i</sub>(x<sub>i</sub>) is the individual utility function for issue i for u<sub>i</sub> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x25.png" xlink:type="simple"/></inline-formula> [0, 1] and the preference degree of an agent to an issue I is denoted as W<sub>i</sub> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-9302101x26.png" xlink:type="simple"/></inline-formula> [0, 9]. Each agent also specifies a minimum acceptable utility level [U<sub>max</sub>, U<sub>min</sub>] to determine if an offer is acceptable.</p><p>Hence, for benefit-oriented, the utility function U<sub>i</sub>(x<sub>i</sub>) is computed as follows :</p><disp-formula id="scirp.60210-formula185"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-9302101x28.png"  xlink:type="simple"/></disp-formula><p>For cost oriented however, the utility function can be as follows:</p><disp-formula id="scirp.60210-formula186"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-9302101x29.png"  xlink:type="simple"/></disp-formula><p>3) Feedback: When negotiation process was finished. Agent gives feedback to appropriate seller or buyer about negotiation whether it is successful or not.</p></sec><sec id="s5"><title>5. Experimental Analysis and Results</title><p>We implemented E-negotiation agent system using rule based and case based approaches. We took a system (automated negotiation and behavior prediction) [<xref ref-type="bibr" rid="scirp.60210-ref6">6</xref>] as an existing system.</p><p>Mohammad Irfan Bala implemented an automated negotiation and behavior prediction system. In this system, during negotiation the agent will store the offers received and predict the preferences of the opponent based on these offers. The negotiation protocol determines the overall order of actions during a negotiation and the agents are obliged to stick to this protocol. In the bilateral alternating offers protocol two parties―agent A and agent B― take turns. Agent A starts the negotiation. Each turn an agent presents one of the three possible actions:</p><p>Accept: This action indicates that agent accepts the opponent’s last bid.</p><p>Offer: This action represents the bid made by an agent.</p><p>End negotiation: This action indicates that the agent terminates the negotiation.</p><p>We compared E-negotiation agent using rule based and case based approaches system with automated negotiation and Behavior Prediction system based on response time.</p><p><xref ref-type="table" rid="table1">Table 1</xref> shows the response time values of both systems. We calculated response time value of both the systems up to 300 users. Therefore we can say that, using rule based and case based approaches E-negotiation pro- cess requires less time as compared to existing system.</p><p><xref ref-type="fig" rid="fig4">Figure 4</xref> shows the comparison graph based on response time.</p><p>In E-negotiation agent using rule based and case based approaches system, all the data which is required for E-negotiation process such as product detail, rule base data, case base data is stored on cloud. Automated negotiation and Behavior Prediction system does not use Cloud computing concept to store negotiation process.</p><p>We calculated CPU utilization (in percentage) and Memory utilization (in percentage) of both systems up to 300 users.</p><p><xref ref-type="table" rid="table2">Table 2</xref> shows the Memory utilization values (in percentage) of both systems.</p><p>Therefore we can say that, due to use of Cloud computing E-negotiation agent using rule based and case based approaches system requires less CPU utilization and Memory utilization as compared to existing system.</p><p><xref ref-type="table" rid="table3">Table 3</xref> shows the CPU utilization values (in percentage) of both systems.</p><p><xref ref-type="fig" rid="fig5">Figure 5</xref> shows the comparison graph based on Memory utilization.</p><p><xref ref-type="fig" rid="fig6">Figure 6</xref> shows the comparison graph based on CPU utilization.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Response time values of both systems</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >No. of Users</th><th align="center" valign="middle" >Response Time (E-Negotiation Agent)</th><th align="center" valign="middle" >Response Time (Existing System)</th></tr></thead><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >256</td><td align="center" valign="middle" >360</td></tr><tr><td align="center" valign="middle" >100</td><td align="center" valign="middle" >591</td><td align="center" valign="middle" >641</td></tr><tr><td align="center" valign="middle" >150</td><td align="center" valign="middle" >723</td><td align="center" valign="middle" >803</td></tr><tr><td align="center" valign="middle" >200</td><td align="center" valign="middle" >1138</td><td align="center" valign="middle" >1157</td></tr><tr><td align="center" valign="middle" >250</td><td align="center" valign="middle" >1364</td><td align="center" valign="middle" >1513</td></tr><tr><td align="center" valign="middle" >300</td><td align="center" valign="middle" >1681</td><td align="center" valign="middle" >1741</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Memory utilization values of both systems</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >No. of Users</th><th align="center" valign="middle" >Memory% (E-Negotiation Agent)</th><th align="center" valign="middle" >Memory% (Existing System)</th></tr></thead><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >%9</td><td align="center" valign="middle" >12%</td></tr><tr><td align="center" valign="middle" >100</td><td align="center" valign="middle" >10%</td><td align="center" valign="middle" >13%</td></tr><tr><td align="center" valign="middle" >150</td><td align="center" valign="middle" >12%</td><td align="center" valign="middle" >16%</td></tr><tr><td align="center" valign="middle" >200</td><td align="center" valign="middle" >15%</td><td align="center" valign="middle" >19%</td></tr><tr><td align="center" valign="middle" >250</td><td align="center" valign="middle" >18%</td><td align="center" valign="middle" >23%</td></tr><tr><td align="center" valign="middle" >300</td><td align="center" valign="middle" >21%</td><td align="center" valign="middle" >27%</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> CPU utilization values of both systems</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >No. of Users</th><th align="center" valign="middle" >CPU% (E-Negotiation Agent)</th><th align="center" valign="middle" >CPU% (Existing System)</th></tr></thead><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >%17</td><td align="center" valign="middle" >20%</td></tr><tr><td align="center" valign="middle" >100</td><td align="center" valign="middle" >34%</td><td align="center" valign="middle" >43%</td></tr><tr><td align="center" valign="middle" >150</td><td align="center" valign="middle" >52%</td><td align="center" valign="middle" >61%</td></tr><tr><td align="center" valign="middle" >200</td><td align="center" valign="middle" >66%</td><td align="center" valign="middle" >73%</td></tr><tr><td align="center" valign="middle" >250</td><td align="center" valign="middle" >71%</td><td align="center" valign="middle" >82%</td></tr><tr><td align="center" valign="middle" >300</td><td align="center" valign="middle" >89%</td><td align="center" valign="middle" >93%</td></tr></tbody></table></table-wrap><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Comparison graph based on response time</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x30.png"/></fig><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Comparison graph based on memory utilization</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x31.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Comparison graph based on CPU utilization</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-9302101x32.png"/></fig></sec><sec id="s6"><title>6. Conclusion and Future Scope</title><p>In order to make faster E-negotiation process, we use the rule base and case based approaches. Two or more parties are coming together during the negotiation process. And there are organizations to maintain data of the negotiation process and product data. But this maintenance is a very tedious job. In order to overcome this problem, all organizations’ product data are stored on cloud. So that system should become flexible.</p><p>This system is a Bilateral Negotiation model. In future this system can be implemented as multilateral negotiation model, behavior prediction and also uses the concept of expert system for increasing success rate of negotiation process.</p></sec><sec id="s7"><title>Cite this paper</title><p>Sheetal R.Vij,AmrutaMore,DebajyotiMukhopadhyay,Avinash J.Agrawal, (2015) An E-Negotiation Agent Using Rule Based and Case Based Approaches: A Comparative Study with Bilateral E-Negotiation with Prediction. Journal of Software Engineering and Applications,08,521-530. doi: 10.4236/jsea.2015.810049</p></sec></body><back><ref-list><title>References</title><ref id="scirp.60210-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Sierra, C. and Wooldridge, M. (2002) Automated Negotiation: Prospects, Methods and Challenges. Group Decision and Negotiation, 10, 199-215.http://dx.doi.org/10.1023/A:1008746126376</mixed-citation></ref><ref id="scirp.60210-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Mukun, C. (2010) Multi-Agent Automated Negotiation as a Service. 7th International Conference on Service System and Service Management (ICSSSM), Tokyo, 28-30 June 2012, 308-313.</mixed-citation></ref><ref id="scirp.60210-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Singh, J., Kumar, B. and Khatn, A. (2012) Securing Storage Data in Cloud Using RC5 Algorithm. International Journal of Advance Computer Research, 2, 94-98.</mixed-citation></ref><ref id="scirp.60210-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">More, A., Vij, S. and Mukhopadhyay, D. (2013) Agent Based Negotiation Using Cloud—An Approach in E-Commerce. Proceedings of 48th Annual Convention of the Computer Society of India, Visakha-patnam, 13-15 December 2013, 489-496.</mixed-citation></ref><ref id="scirp.60210-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Liu, X.W. and Yu, J. (2012) Hybrid Approach Using RBR and CBR to Design an Automated Negotiation Model for Tourism Companies. 2012 International Conference on Management of E-Commerce and E-Government, 21, 197-201.</mixed-citation></ref><ref id="scirp.60210-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Bala, M.I., Vij, S. and Mukhopadhyay, D. (2013) Negotiation Life Cycle: An Approach in E-Negotiation with Prediction. Proceedings of 48th Annual Convention of the Computer Society of India, Visakhapatnam, 13-15 December 2013, 505-512.</mixed-citation></ref><ref id="scirp.60210-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Vrbaski, M. and Petriu, D. (2012) Tool Support for Combined Rule-Based and Goal-Based Reasoning in Context-Aware Systems. Requirement Engineering Conference 2012, Chicago, 24-28 September 2012, 335-336.</mixed-citation></ref><ref id="scirp.60210-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Soh, L.-K. and Tsatsoulis, C. (2001) Agent-Based Argumentative Negotiations with Case-Based Reasoning. AAAI Technical Report FS-01-03.</mixed-citation></ref><ref id="scirp.60210-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Maes, P., Guttman, R. and Moukas, A. (1999) Agents That Buy and Sell. Communications of the ACM, 42, 81-91.ttp://dx.doi.org/10.1145/295685.295716</mixed-citation></ref><ref id="scirp.60210-ref10"><label>10</label><mixed-citation publication-type="book" xlink:type="simple">Wurman, P., Wellman, M. and Walsh, W. (1998) The Michigan Internet AuctionBot: A Configurable Auction Server for Human and Software Agents. In: Sycara, K.P. and Wooldridge, M., Eds., Proceedings of the 2nd International Conference on Autonomous Agents, ACM Press, New York, 301-308. http://dx.doi.org/10.1145/280765.280847</mixed-citation></ref><ref id="scirp.60210-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Rau, H., Chen, C.-W. and Shiang, W.-J. (2009) Development of an Agent-Based Negotiation Model for Buyer-Supplier Relationship with Multiple Deliveries. Proceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, Okayama, 26-29 March 2009, 308-312.</mixed-citation></ref><ref id="scirp.60210-ref12"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Ateib</surname><given-names> M.T. </given-names></name>,<etal>et al</etal>. (<year>2010</year>)<article-title>Agent Based Negotiation in E-Commerce</article-title><source> International Symposium on Information Technology 2010</source><volume> 2</volume>,<fpage> 861</fpage>-<lpage>868</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref></ref-list></back></article>