<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0718-1876</journal-id>
<journal-title><![CDATA[Journal of theoretical and applied electronic commerce research]]></journal-title>
<abbrev-journal-title><![CDATA[J. theor. appl. electron. commer. res.]]></abbrev-journal-title>
<issn>0718-1876</issn>
<publisher>
<publisher-name><![CDATA[Universidad de Talca]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0718-18762011000300007</article-id>
<article-id pub-id-type="doi">10.4067/S0718-18762011000300007</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Developing a Fuzzy Multi-attribute Matching and Negotiation Mechanism for Sealed-bid Online Reverse Auctions]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Tsai]]></surname>
<given-names><![CDATA[Kune-muh]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Chou]]></surname>
<given-names><![CDATA[Feng-chin]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,National Kaohsiung First University of Science and Technology Department of Logistics Management ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Taiwan</country>
</aff>
<aff id="A02">
<institution><![CDATA[,National Kaohsiung First University of Science and Technology Institute of Management WuFeng University Department of Hospitality Management]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Taiwan</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2011</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2011</year>
</pub-date>
<volume>6</volume>
<numero>3</numero>
<fpage>85</fpage>
<lpage>96</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_arttext&amp;pid=S0718-18762011000300007&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_abstract&amp;pid=S0718-18762011000300007&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_pdf&amp;pid=S0718-18762011000300007&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Online reverse auctions have benefits in reducing business purchasing costs and lead times. Previous research focused on developing new mechanisms for open-cry and multiple rounds of auctions, which is not appropriate for direct goods purchasing. Moreover, the implementation issues in the web-site design are not considered. We construct an easily-computed fuzzy multi-attribute matching mechanism for sealed-bid and single round auctions, which include price and attributes like quality, due dates, credit rating, etc, and are suitable for procuring direct input goods. To improve the negotiation quality, an aftermath negotiation mechanism is also developed so that the auctioneer can negotiate with the bidders for certain attribute values when the bid does not meet the requirement of the auctioneer. We further build an online fuzzy negotiation system (FNS) to evaluate the proposed mechanism.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Online reverse auctions]]></kwd>
<kwd lng="en"><![CDATA[Multi-attribute]]></kwd>
<kwd lng="en"><![CDATA[Sealed-bid]]></kwd>
<kwd lng="en"><![CDATA[Fuzzy sets]]></kwd>
<kwd lng="en"><![CDATA[Negotiations]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="2"><b>Journal of Theoretical and Applied Electronic Commerce Research</b></font></p>  	    <p align="justify"><font face="verdana" size="2">ISSN 0718&#45;1876 Electronic Version</font> <font face="verdana" size="2">VOL 6 / ISSUE 3 / DECEMBER 2011 / 85&#45;96</font> ; <font face="verdana" size="2">&copy; 2011 Universidad de Talca &#45; Chile</font></p>  	    <p align="justify"><font face="verdana" size="2">This paper is available online at <a href="http://www.jtaer.com" target="_blank">www.jtaer.com</a></font></p>  	    <p align="justify"><font face="verdana" size="2">DOI: 10.4067/S0718&#45;18762011000300007</font></p>  	    <p align="justify">&nbsp;</p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="3"><b>Developing a Fuzzy Multi&#45;attribute Matching and Negotiation Mechanism for Sealed&#45;bid Online Reverse Auctions</b></font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Kune&#45;muh Tsai<sup>1</sup> and Feng&#45;chin Chou<sup>2</sup></b></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>1</sup> National Kaohsiung First University of Science and Technology, Department of Logistics Management,</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><a href="mailto:kmtsai@ccms.nkfust.edu.tw">kmtsai@ccms.nkfust.edu.tw</a> <sup>2</sup> National Kaohsiung First University of Science and Technology, Institute of Management <sup>2</sup> WuFeng University, Department of Hospitality Management, <a href="mailto:fcchou@wfu.edu.tw">fcchou@wfu.edu.tw</a></font></p> 	    <p align="justify">&nbsp;</p> 	<hr> 	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Online reverse auctions have benefits in reducing business purchasing costs and lead times. Previous</font> <font face="verdana" size="2">research focused on developing new mechanisms for open&#45;cry and multiple rounds of auctions, which is not </font><font face="verdana" size="2">appropriate for direct goods purchasing. Moreover, the implementation issues in the web&#45;site design are not </font><font face="verdana" size="2">considered. We construct an easily&#45;computed fuzzy multi&#45;attribute matching mechanism for sealed&#45;bid and</font> <font face="verdana" size="2">single round auctions, which include price and attributes like quality, due dates, credit rating, etc, and are</font> <font face="verdana" size="2">suitable for procuring direct input goods. To improve the negotiation quality, an aftermath negotiation</font> <font face="verdana" size="2">mechanism is also developed so that the auctioneer can negotiate with the bidders for certain attribute values</font> <font face="verdana" size="2">when the bid does not meet the requirement of the auctioneer. We further build an online fuzzy negotiation </font> <font face="verdana" size="2">system (FNS) to evaluate the proposed mechanism.</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Online reverse auctions, Multi&#45;attribute, Sealed&#45;bid, Fuzzy sets, Negotiations</font></p> 	<hr> 	    <p align="justify"><font face="verdana" size="3"><b>1&nbsp;Introduction</b></font></p>  	    <p align="justify"><font face="verdana" size="2">The growth of Internet technologies conduces to wide spread use of online reverse auctions for B2B (Business&#45;to&#45;</font><font face="verdana" size="2">business) transactions. An e&#45;marketplace in B2B is composed of three main parties: suppliers, buyers, and market</font> <font face="verdana" size="2">intermediaries. The suppliers desire to attain more profits/revenues by approaching more customers, while the</font> <font face="verdana" size="2">buyers attempt to find an economic way to place orders &#91;23&#93;. In many companies, online reverse auctions have</font> <font face="verdana" size="2">yielded savings in terms of price reductions as well as improvements in the purchasing process &#91;3&#93;, &#91;16&#93;. Prior research indicated that online reverse auctions for standardized products can have benefits in purchase price</font> <font face="verdana" size="2">savings for buyers ranging from 5% to 20% &#91;1&#93;, &#91;23&#93;. Since online reverse auctions can lead to reduced order cycle</font> <font face="verdana" size="2">time and increased productivity &#91;4&#93;, it has obtained considerable attention &#91;9&#93;, &#91;23&#93;, &#91;31&#93;. Furthermore, the success of online reverse auctions can help buyers diversify their supplier base to hedge against risks, and also help suppliers </font> <font face="verdana" size="2">reduce operational and customer acquisition costs &#91;12&#93;.</font></p> 	    <p align="justify"><font face="verdana" size="2">Transactions between enterprises are complicated. The seller and buyer need to evaluate and negotiate with each other and consider many factors during transactions. There are several types of auction protocols; two of the most</font> <font face="verdana" size="2">popular forms are the ascending price <i>English auction</i> where the lowest price of bid wins and the descending price </font> <font face="verdana" size="2"><i>Dutch auction</i> where the highest price of bid wins &#91;9&#93;&#45;&#91;10&#93;, &#91;33&#93;. Some other types of classification includes: single or </font><font face="verdana" size="2">multiple units of auctions; single or multiple attributes of auctions; open&#45;cry or sealed&#45;bid of auctions; single or</font> <font face="verdana" size="2">multiple rounds of auctions, etc. In the open&#45;cry auction, full price visibility is made available to all participants; while</font> <font face="verdana" size="2">in the sealed&#45;bid, bidders have no visibility of the price submitted &#91;23&#93;, &#91;32&#93;. Traditional reverse auctions are </font><font face="verdana" size="2">performed in a sealed&#45;bid and single unit form, which is still common nowadays for sourcing of direct input goods </font><font face="verdana" size="2">or engineering projects &#91;32&#93;&#45;&#91;33&#93;. In procuring direct input goods, companies usually implement with a single round and </font><font face="verdana" size="2">sealed&#45;bid tendering protocol since those suppliers are different from general goods suppliers in that the former </font><font face="verdana" size="2">require special certification process to make sure the quality, credit, delivery etc. meet the requirement of the buyer</font><font face="verdana" size="2">&#91;2&#93;, &#91;5&#93;&#45;&#91;6&#93;, &#91;10&#93;. The auctioneer and bidders for this kind of goods cooperate rather than compete with each other to </font> <font face="verdana" size="2">pursue for the long&#45;term relationship and procedural fairness &#91;25&#93;; the tendered bids usually can be matched (but not negotiated) in a single round. For indirect goods, like MRO (maintenance, repair and operations) goods, procurement can be performed with an open&#45;cry and multiple rounds of auction in order to achieve as low as possible the price, which has attracted a lot of attention recently &#91;2&#93;, &#91;15&#93;, &#91;26&#93;, &#91;32&#93;&#45;&#91;33&#93;. The auctioneer and bidders for indirect goods</font> <font face="verdana" size="2">tend to be self&#45;interest oriented since their primary concern is the respective interests instead of the relationship &#91;13&#93;&#45;</font><font face="verdana" size="2">&#91;14&#93;; the negotiation process (but not matching process) usually proceeds with several rounds. Moreover, multiple </font> <font face="verdana" size="2">attributes are considered in business procurement &#91;13&#93;&#45;&#91;14&#93;, &#91;32&#93;&#45;&#91;33&#93;, such as the unit price of the product, delivery</font> <font face="verdana" size="2">time, quality, warranty, etc., and different issues are accorded different weights by negotiators. It enables trade&#45;offs </font><font face="verdana" size="2">between different attributes, such that the two parties can arrive at a mutually beneficial agreement. This study aims</font> <font face="verdana" size="2">at developing a reverse auction mechanism for direct input goods in a sealed&#45;bid and single round environment.</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="3"><b>2&nbsp;Background and Focuses</b></font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">There were some studies conducted in reverse auctions with multi&#45;attribute negotiations. Teich et al. &#91;32&#93;&#45;&#91;33&#93;</font> <font face="verdana" size="2">studied an e&#45;auction mechanism in a multi&#45;round and open&#45;bid environment; they considered not only price and </font><font face="verdana" size="2">quantity combinations, but also other relevant attributes. However, they only provide a prototype instead of explicit</font> <font face="verdana" size="2">mechanism. Leskela et al. &#91;26&#93; later extended the work of Teich et al. &#91;33&#93; to multi&#45;unit combinatorial auctions and</font> <font face="verdana" size="2">Ervasti et al. &#91;11&#93; further improved that of Leskela et al. &#91;26&#93; with the Group Support Mechanism for the efficiency of </font><font face="verdana" size="2">combinatorial auctions. In Bichler and Kalagnanam &#91;2&#93;, they implemented with mixed&#45;integer programming (MIP)</font> <font face="verdana" size="2">formulation to study configurable multi&#45;attribute auctions for single or multiple sourcing with order allocations </font><font face="verdana" size="2">mechanism to determine winning bidders. The mechanism is applied in a multi&#45;round and open&#45;cry environment. </font><font face="verdana" size="2">However, the MIP formulation makes the auction mechanism difficult to solve. To study the sealed&#45;bid, multiple&#45;issue</font> <font face="verdana" size="2">reverse auction problem, Cheng &#91;6&#93; presented a multi&#45;attribute decision making problem for buyers to choose among</font> <font face="verdana" size="2">the bidders with the TOPSIS approach proposed by Hwang and Yoon &#91;20&#93;. He also implemented a multiple&#45;objective </font><font face="verdana" size="2">model for bidders and included the available&#45;to&#45;promise (ATP) inventory in the model. Despite this many practical </font><font face="verdana" size="2">problems were considered, the computation procedure of his models is not straightforward, which limits its </font><font face="verdana" size="2">implementation to online auction systems.</font></p> 	    <p align="justify"><font face="verdana" size="2">Multi&#45;agents are widely used in modeling auction protocols (e.g., &#91;7&#93;, &#91;10&#93;, &#91;13&#93;&#45;&#91;14&#93;, &#91;27&#93;, &#91;29&#93;&#45;&#91;30&#93;, &#91;32&#93;, &#91;34&#93;, &#91;35&#93;); </font><font face="verdana" size="2">however, except some exceptions (e.g., &#91;34&#93;, &#91;35&#93;), most are conducted with protocol simulation to test how well their</font> <font face="verdana" size="2">negotiation mechanisms are as compared to others (e.g., &#91;7&#93;, &#91;10&#93;, &#91;14&#93;, &#91;27&#93;, &#91;29&#93;&#45;&#91;30&#93;). Even though some of the </font><font face="verdana" size="2">negotiation protocols of those studies can be referenced for reverse auctions, the development environments and</font> <font face="verdana" size="2">requirements are completely different from those of the online reverse auctions. In addition, many of those protocols</font> <font face="verdana" size="2">are more applicable to one&#45;to&#45;one negotiation rather than to one&#45;to&#45;many or many&#45;to&#45;one's. Among those studies, </font><font face="verdana" size="2">Jennings and their research team (e.g., &#91;13&#93;, &#91;14&#93;, &#91;29&#93;) performed a series of significant research in multi&#45;issue </font> <font face="verdana" size="2">negotiation with self&#45;interested software agents to examine the negotiation protocols as well as the negotiation behaviors from game theory perspectives. Teuteberg &#91;34&#93; implemented a multilateral negotiation model with fuzzy </font><font face="verdana" size="2">preferences on an agent&#45;based job&#45;marketplace. Nassiri&#45;Mofakham &#91;27&#93; considered adding personality into multi&#45;</font><font face="verdana" size="2">agent models that agents can act more closely to human&#45;like conducts to enhance the realism of rational bargaining</font></p> 	    <p align="justify"><font face="verdana" size="2">behaviors. Wang et al. &#91;36&#93; presented with autonomous agents a 2&#45;phase evaluation model, a parallel dispatch</font> <font face="verdana" size="2">model and an auction&#45;like negotiation model for B2C e&#45;marketplaces. David, et al. &#91;10&#93; proposed a sealed&#45;bid, multi&#45;</font><font face="verdana" size="2">attribute reverse auction model and considered three protocols, but they did not include detailed implementation </font><font face="verdana" size="2">issues. Shih et al. &#91;30&#93; proposed an automated negotiation model using a mobile reverse auction agent system to </font><font face="verdana" size="2">mediate between the buyer and sellers and to execute bidding asynchronously, autonomously and repetitively.</font><font face="verdana" size="2">Cheng et al. &#91;7&#93; proposed an agent&#45;based heuristic model for making trade&#45;offs in automated negotiations by fuzzy</font> <font face="verdana" size="2">inference systems.</font></p> 	    <p align="justify"><font face="verdana" size="2">The above works mainly studied auction mechanisms that are appropriate for general goods, like MRO, and are not</font> <font face="verdana" size="2">suitable for direct input goods, which accounts for major purchasing amounts in industries &#91;5&#93;&#45;&#91;6&#93;, &#91;8&#93;, &#91;10&#93;, &#91;20&#93;. Our </font><font face="verdana" size="2">study focuses on developing a matching mechanism for reverse auctions of direct input goods or engineering </font><font face="verdana" size="2">projects in a B2B business environment. The mechanism is to be applied in a single round, single unit and sealed&#45;</font><font face="verdana" size="2">bid auction environment with multi&#45;attribute, which is the first focus of our study.</font></p> 	    <p align="justify"><font face="verdana" size="2">While the product attributes negotiated between the buyer and seller in an e&#45;marketplace can be expressed in crisp values, this kind of expression is not proper to describe the requirement clearly in practice &#91;34&#93; because human judgments and preferences are often vague and cannot be estimated with exact numerical value. As claimed by Gu and Zhu &#91;18&#93;, a more realistic approach may be to use linguistic assessments instead of numerical values. Most current B2B reverse auction sites implement with straightforward arithmetic operations like add, subtract and multiplication, etc. to choose among the submitted bidders &#91;32&#93; and ignore human uncertainty in making judgments </font><font face="verdana" size="2">and expressing their preferences, which might deviate the real intention of bidders and auctioneers. In the literature,</font> <font face="verdana" size="2">the application of fuzzy sets theory in real world decision&#45;making problems has given very good results because it</font> <font face="verdana" size="2">provide a more flexible solution framework &#91;7&#93;, &#91;18&#93;, &#91;34&#93;, &#91;36&#93;. Thus, the second focus of our study is to implement </font> <font face="verdana" size="2">the fuzzy sets theory to model the multiple attributes to reflect the linguistic representation of buyers and sellers in </font><font face="verdana" size="2">auctions.</font></p> 	    <p align="justify"><font face="verdana" size="2">Foroughi et al. &#91;15&#93; mentioned that as a supplier faces the most important customers, they will bid more aggressively</font> <font face="verdana" size="2">and may be willing to settle for a lower price than when facing with less important customers. As a result, in the</font> <font face="verdana" size="2">transaction process of a buyer and a supplier, both parties may adopt different negotiation attributes and weights </font><font face="verdana" size="2">according to both relationship&#45;based and market&#45;based coordination &#91;17&#93;. Kumar et al. &#91;25&#93; stated that enhanced </font><font face="verdana" size="2">procedural fairness can maintain relationship quality and is the basis of sustained competitive advantage. Daly and</font> <font face="verdana" size="2">Nath &#91;8&#93;&#45;&#91;9&#93; cited previous research to support post&#45;auction negotiations that are beneficial to maintain procedural</font> <font face="verdana" size="2">fairness. Therefore, the post&#45;auction negotiations can be planned as an additional step before final supplier selection &#91;8&#93;&#45;&#91;9&#93;, &#91;35&#93;. Not only has our study developed a multi&#45;attribute negotiation mechanism, we also have incorporated an aftermath negotiation mechanism in reverse auctions to implement the integrative negotiation strategy with a hope to fulfill a 'win&#45;win' goal. Therefore, the third focus of our study is to augment an aftermath negotiation mechanism in addition to the fuzzy multi&#45;attribute matching mechanism such that the buyer and sellers can negotiate after the</font> <font face="verdana" size="2">auction has ended.</font></p> 	    <p align="justify"><font face="verdana" size="2">The preceding studies (e.g. &#91;6&#93;&#45;&#91;7&#93;, &#91;10&#93;, &#91;13&#93;&#45;&#91;14&#93;, &#91;27&#93;, &#91;29&#93;, &#91;32&#93;&#45;&#91;33&#93;) about the negotiation mechanisms of online </font> <font face="verdana" size="2">reverse auctions mainly adopted negotiation agents or mathematical optimization models for auctions like MRO </font><font face="verdana" size="2">or </font><font face="verdana" size="2">eBay type of products, which requires several rounds of negotiation to reach equilibrium for both parties. Those</font> <font face="verdana" size="2">negotiation mechanisms are not appropriate for our focus in direct input goods. Furthermore, those mechanisms are mainly developed either with mathematical programming models (e.g. &#91;6&#93;, &#91;10&#93;, &#91;32&#93;&#45;&#91;33&#93;) or with multi&#45;agent </font><font face="verdana" size="2">protocols (e.g. &#91;7&#93;, &#91;13&#93;&#45;&#91;14&#93;, &#91;27&#93;, &#91;29&#93;); hence, they cannot be easily embedded in the web&#45;site design. Actually, if an</font> <font face="verdana" size="2">aftermath negotiation mechanism were to be added up to their studies, it would complicate the computation procedures. In contrast, our fuzzy auction mechanism can be handily integrated into an existing reverse auction web-site for direct input goods or outsourcing of projects. As the strategic supplier fails to render the best bid, the buyer can alternatively negotiate with them to obtain an appropriate transaction with our aftermath negotiation mechanism to create a win&#45;win situation.</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="3"><b>3 Fuzzy Matching and Negotiation Mechanism Development</b></font></p> 	    <p align="justify"><font face="verdana" size="2">This study focuses on developing a multi&#45;attribute single&#45;round bidding mechanism with aftermath negotiations. In a reverse auction for direct input goods or engineering projects via Internet, a tendered bid is usually initiated by a buyer or an auctioneer who specifies the requirements with attributes like quantity, quality, due dates, prices, etc. The bid information is then broadcasted via Internet to potential suppliers who are bidders in the reverse auction. Those potential suppliers are usually invited, and before participating in the reverse auction, they are verified by the buyer. Qualified bidders read the bid information and those who are interested propose their bid offers to the reverse auction systems. The systems then match the tendered bid requirements of the buyer with bid offers through the </font><font face="verdana" size="2">matching mechanism.</font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">The bidding process of our study is divided into three stages, as Figure 1 shows. In the first stage, a request is </font><font face="verdana" size="2">proposed by a buyer, and different weights are given according to the importance levels of attributes the buyer </font><font face="verdana" size="2">emphasizes. In the second stage, several sellers provide their bid offers based on the buyer's request. In the third </font><font face="verdana" size="2">stage, the fuzzy negotiation matching mechanism selects the optimal bid as a reference for decision makers, based</font></p> 	    <p align="justify"><font face="verdana" size="2">on the buyer's requests and bid offers from sellers. Further, our system considers the situation when the buyer is </font><font face="verdana" size="2">dissatisfied with the offer of the winning bid (i.e., lower than the lowest threshold value of the buyer). When this</font> <font face="verdana" size="2">happens, the system initiates the aftermath negotiations for the buyer to negotiate the transaction terms agreed upon</font> <font face="verdana" size="2">by both parties. In order to express the non&#45;quantifiable meaning and perception in negotiation attributes, the reverse </font><font face="verdana" size="2">auction systems utilize fuzzy sets theory to define the negotiation terms of attributes as well as the matching</font> <font face="verdana" size="2">mechanism.</font></p> 	    <p align="justify"><font face="verdana" size="2">Assume that <img src="/fbpe/img/jtaer/v6n3/art07.fig45.jpg" width="62" height="11"> is a fuzzy triangular number, where <i>i</i> &isin; &#91;1,......,<i>n</i>&#93; and <img src="/fbpe/img/jtaer/v6n3/art07.fig46.jpg" width="29" height="9"> denotes the values of</font> <font face="verdana" size="2">the three apexes of the triangle from left to right. According to the characteristics of fuzzy triangular numbers and the </font><font face="verdana" size="2">extension principle, the addition and subtraction of any two fuzzy triangular numbers of <i>A</i>&lt;sub&gt;1&lt;/sub&gt; </font><font face="verdana" size="2">and <i>A&lt;sub&gt;2&lt;/sub&gt; </i>, and the</font> <font face="verdana" size="2">intersection of a constant <i>&lambda;</i> and a fuzzy triangular number are as follows &#91;24&#93;.</font></p>  	    
<p align="justify">&nbsp;</p> 	    <p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig1.jpg" width="141" height="30"></p> 	    
<p align="right"><font face="verdana" size="2">(1)</font></p>  	    <p><font face="verdana" size="2">Defuzzification process converts fuzzy numbers into representative crisp values. Literature reveals many </font><font face="verdana" size="2">defuzzification methods, such as the centroid of area, bisector of area, mean of maximum, etc. &#91;21&#93;. The centroid of </font><font face="verdana" size="2">a triangle is the average value of the three apexes of the triangle &#91;24&#93;. This study employs the centroid of area as the </font><font face="verdana" size="2">defuzzification method to reduce the complexity of computation. If other fuzzy functions are implemented, we only</font> <font face="verdana" size="2">need to compute the centroids of them to obtain the crisp values as the defuzzification values. For <i>&lt;sub&gt;i&lt;/sub&gt;&#161;</i> in Eq.(1), the </font><font face="verdana" size="2">defuzzification of the triangular&#45;shape fuzzy number <i>df(A&lt;sub&gt;i&lt;/sub&gt;)</i> is as follows:</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig2.jpg" width="83" height="9"> </p> 	    
]]></body>
<body><![CDATA[<p align="right"><font face="verdana" size="2">(2)</font></p> 	    <p align="justify"><font face="verdana" size="2">This study employs the triangular&#45;shape fuzzy number for ease of computation and closeness of the computed </font><font face="verdana" size="2">results than if other shapes of fuzzy numbers, such as trapezoidal fuzzy numbers, bell&#45;shaped fuzzy numbers, are </font><font face="verdana" size="2">implemented &#91;21&#93;, &#91;24&#93;. The triangular&#45;shape fuzzy number is thus suitable to be applied to our online matching </font><font face="verdana" size="2">systems for bidding.</font></p> 	    <p>&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig3.jpg" width="349" height="268"></p> 	    
<p>&nbsp;</p> 	    <p align="center"><font face="verdana" size="2">Figure 1: Multi&#45;attribute matching mechanism <b>3.1 The Matching Process</b></font></p> 	    <p align="justify"><strong><font size="2" face="verdana">3.1 The Matching Process</font></strong></p> 	    <p align="justify"><font face="verdana" size="2">In a bidding process, the buyer makes a request with the required negotiation attributes, such as price, quality, and </font><font face="verdana" size="2">due dates, and the respective weights for the attributes. The sellers then respond to the request with their tendered </font><font face="verdana" size="2">bids, after referring to the terms and weights of attributes requested by the buyer. The matching system then </font><font face="verdana" size="2">computes and ranks each bid with reference to the negotiation terms and weights. Because the negotiation units</font> <font face="verdana" size="2">such as price, quality, and due dates could be different, the negotiation terms must be normalized to have equivalent </font><font face="verdana" size="2">size of value before performing the matching operation. After performing the fuzzy arithmetic operations of</font> <font face="verdana" size="2">negotiation terms to obtain triangular fuzzy membership functions, defuzzification is carried out to compute the total</font></p> 	    <p align="justify"><font face="verdana" size="2">evaluation value of each seller's bid. The values are sorted as a reference for the buyer to select among the sellers'</font> <font face="verdana" size="2">offers.</font></p> 	    <p align="justify"><font face="verdana" size="2">Fuzzy negotiation terms of attributes have benefits in the natural representation of human intention; the triangular</font> <font face="verdana" size="2">fuzzy number also makes the mathematical calculation easy to be implemented in a web&#45;site system. The</font> <font face="verdana" size="2">negotiation matching process of the study is described below.</font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><i>Stage 1 Setting the requirements of a buyer</i></font></p> 	    <p align="justify"><font face="verdana" size="2">The buyer first sets the purchase requirements, such as product name, quantity, specifications, and other negotiation </font><font face="verdana" size="2">attributes (e.g., price, quality, due dates, and credit rating). In this study, we use triangular fuzzy numbers to </font><font face="verdana" size="2">represent the fuzzy behavior of negotiation attributes, which have their own specific interval ranges of <i>X.</i> In the </font><font face="verdana" size="2">interval range, an <i>x</i> <i>&isin;</i> <i>X</i> that is most likely to happen has a membership grade of 1, while the least likely has 0. </font><font face="verdana" size="2">Since the buyer may regard each negotiation attribute differently, he can set diverse weights for the negotiation</font> <font face="verdana" size="2">attributes. Let <i>n</i> represent the number of negotiation attributes and <i>i</i> &isin; &#91;1,......,<i>n</i>&#93; the index of negotiation attributes,</font> <font face="verdana" size="2">then the ith negotiation attribute can be represented by a triangular fuzzy number of <i>A&lt;sub&gt;i&lt;/sub&gt;</i> (<i>x</i>) <i>= <img src="/fbpe/img/jtaer/v6n3/art07.fig4.jpg" width="55" height="12"></i> , and for</font><font face="verdana" size="2">u</font><font face="verdana" size="2"><i>&lt;sub&gt;i&lt;/sub&gt;</i></font><font face="verdana" size="2">, v<i>&lt;sub&gt;i&lt;/sub&gt;</i>, z<i>&lt;sub&gt;i&lt;/sub&gt;</i><i>,</i> having values between 0 and 1, the ith negotiation weight is set as <img src="/fbpe/img/jtaer/v6n3/art07.fig5.jpg" width="67" height="13"> . Fuzzy weights can be</font> <font face="verdana" size="2">defined by the buyer with functions like triangles. Those weights can be represented by a set of linguistic fuzzy</font> <font face="verdana" size="2">variables as well. Linguistic variables are the words used in human languages to express the decision maker's</font> <font face="verdana" size="2">feeling of the importance level of attributes with pre&#45;determined triangle values &#91;20&#93;. For example, we can set very </font><font face="verdana" size="2">important as w(0.7,0.9,1), important as w(0.5,0.7,0.9), fair as <i>w</i> (0.3,0.5,0.7), insignificant as w(0.1,0.3,0.5), etc. In</font> <font face="verdana" size="2">either way, the compound vector forms of the negotiation attributes are then defined as <img src="/fbpe/img/jtaer/v6n3/art07.fig6.jpg" width="103" height="14"></font> <font face="verdana" size="2">and weights as <i><img src="/fbpe/img/jtaer/v6n3/art07.fig7.jpg" width="84" height="15"></i></font></p> 	    
<p align="justify"><font face="verdana" size="2"><i>Stage 2 Setting the bid offers of sellers</i></font></p> 	    <p align="justify"><font face="verdana" size="2">In response to the tendered bid, sellers prepare bid offers according to the product name, quantity and specifications</font> <font face="verdana" size="2">provided by the buyer. The bid offers contain the same kinds of attributes requested by the buyer. Let <i>m</i> be number</font> <font face="verdana" size="2">of bid offers, <i>j</i> &isin; &#91;1,......, <i>m</i>&#93; the index of bid offers, <i>y</i><i>&acirc;</i> the crisp values of the ith negotiation attribute of the jth bid</font> <font face="verdana" size="2">offer. The compound vector form of the jth offer for negotiation attributes of <i>i</i> is then <img src="/fbpe/img/jtaer/v6n3/art07.fig8.jpg" width="81" height="16"></font></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><i>Stage 3 Matching and negotiation</i></font></p>  	    <p align="justify"><font face="verdana" size="2">Negotiation terms have different units, and thus normalization is required before performing the fuzzy negotiation</font> <font face="verdana" size="2">matching process. The normalization fits the value proposed by bid offer <i>j</i> into the fuzzy negotiation term <i>A&lt;sub&gt;i&lt;/sub&gt;</i>of </font><font face="verdana" size="2">attribute <i>i</i> requested by the seller to reflect the level of fitness of the bid offer to the request. Normalization of <i>y&lt;sub&gt;j&lt;/sub&gt;&lt;sub&gt;i&lt;/sub&gt;</i> </font><font face="verdana" size="2">into </font><font face="verdana" size="2">A<i>&lt;sub&gt;i&lt;/sub&gt;</i>, denoted by <i>A&lt;sub&gt;i&lt;/sub&gt;(y&lt;sub&gt;j&lt;/sub&gt;&lt;sub&gt;i&lt;/sub&gt;)</i><i>,</i> has a value between 0~1. In this study, <i>A&lt;sub&gt;i&lt;/sub&gt; </i>is a triangular fuzzy number; thus, depending on the</font> <font face="verdana" size="2">value of <i>y!&#161;, A&lt;sub&gt;i&lt;/sub&gt;</i><i> (y&lt;sub&gt;j&lt;/sub&gt;&lt;sub&gt;i&lt;/sub&gt;) </i>exists in either of the two forms, as is shown below and Figure 2 (a) and Figure 2 (b):</font></p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig9.jpg" width="173" height="12"></p> 	    
<p align="right"><font face="verdana" size="2"><sup>(3)</sup></font></p>  	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig10.jpg" width="174" height="11"></p> 	    
]]></body>
<body><![CDATA[<p align="right"><font face="verdana" size="2">(4)</font></p> 	    <p align="justify"><font face="verdana" size="2">After normalizing the negotiation terms, the normalized offer of <img src="/fbpe/img/jtaer/v6n3/art07.fig11.jpg" width="76" height="16"> is then presented as</font> <i><font size="2" face="verdana"><img src="/fbpe/img/jtaer/v6n3/art07.fig12.jpg" width="130" height="17"></font></i><font face="verdana" size="2">, which represents the level of fitness of bid offer <i>j</i> from the seller on the respective</font> <font face="verdana" size="2">attributes <i>i</i> <i>&isin;</i> &#91;1,......,<i>n</i>&#93; requested by the buyer.</font></p> 	    
<p align="justify">&nbsp;</p>  	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig13.jpg" width="423" height="152"></p> 	    
<p>&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2">After normalization, the values given by the buyer and sellers are calculated to obtain the evaluation value of the </font><font face="verdana" size="2">sellers' offer. <img src="/fbpe/img/jtaer/v6n3/art07.fig14.jpg" width="58" height="12"><i> </i>denote the fuzzy number of the jth seller's offer on the ith negotiation attribute and</font> <font face="verdana" size="2"><i><img src="/fbpe/img/jtaer/v6n3/art07.fig15.jpg" width="36" height="12"></i> the total fuzzy evaluation value of the jth seller's offer. By multiplying <i>A&lt;sub&gt;i&lt;/sub&gt;</i><i> (y&lt;sub&gt;j&lt;/sub&gt;&lt;sub&gt;i&lt;/sub&gt;)</i>with the corresponding ith</font> <font face="verdana" size="2">fuzzy negotiation weight <img src="/fbpe/img/jtaer/v6n3/art07.fig16.jpg" width="70" height="13"> the fuzzy evaluation value of the jth offer on the ith negotiation attribute</font> <font face="verdana" size="2"><i><img src="/fbpe/img/jtaer/v6n3/art07.fig17.jpg" width="41" height="12"></i> can be obtained. The total evaluation fuzzy number of bid <i>j,</i> denoted as <img src="/fbpe/img/jtaer/v6n3/art07.fig18.jpg" width="42" height="12"> can then be</font> <font face="verdana" size="2">determined by adding the fuzzy evaluation values <img src="/fbpe/img/jtaer/v6n3/art07.fig14.jpg" width="58" height="12">of all the negotiation attributes for <i>i</i> &isin;&#91;1,......, <i>n</i> &#93; .</font> <font face="verdana" size="2">Therefore, we have</font></p> 	    
<p align="center" dir="rtl"><img src="/fbpe/img/jtaer/v6n3/art07.fig19.jpg" width="343" height="40"></p> 	    
<p dir="rtl">&nbsp;</p> 	    <p dir="rtl"><font face="verdana" size="2">Through the defuzzification such as Eq. (2), the total evaluation value of the jth bid offer<i> <img src="/fbpe/img/jtaer/v6n3/art07.fig20.jpg" width="40" height="12"></i>, denoted as </font> <font face="verdana" size="2"><img src="/fbpe/img/jtaer/v6n3/art07.fig21.jpg" width="54" height="12">, can be obtained. Specifically, larger total evaluation value of a bid offer means the bid offer fits more</font> <font face="verdana" size="2">closely to the tendered bid. Therefore, the defuzzified value of bid offers <i>j</i> &isin; &#91;1,......, <i>m</i>&#93; are computed and ranked to</font> <font face="verdana" size="2">obtain the largest total evaluation value as <img src="/fbpe/img/jtaer/v6n3/art07.fig22.jpg" width="161" height="16">.</font></p> 	    
<p align="justify"><font face="verdana" size="2">The tendered bid with the highest total evaluation value is recommended by the matching system to the buyer. If the</font> <font face="verdana" size="2">buyer is satisfied with the recommended bid offer, the negotiation process is terminated; otherwise, an adjustment in</font> <font face="verdana" size="2">the bid offers from the sellers is required, and the negotiation process enters into the aftermath negotiations.</font></p> 	    ]]></body>
<body><![CDATA[<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>3.2 Conducting Aftermath Negotiations</b></font></p> 	    <p align="justify"><font face="verdana" size="2">During the negotiation process, the seller and the buyer have their own opinions, so a good match usually requires </font><font face="verdana" size="2">several times of negotiations. In addition, when the negotiation has reached an impasse, the seller and the buyer</font> <font face="verdana" size="2">cannot conclude with the transaction. To restart the negotiation mechanism when the impasse happens, this study</font> <font face="verdana" size="2">utilizes the aftermath negotiations, where the buyer can set a target total evaluation value to re&#45;calculate a </font><font face="verdana" size="2">negotiation value specified by the buyer when the buyer is dissatisfied with the negotiation term (e.g., price is high or </font><font face="verdana" size="2">quality is poor, etc.) proposed by the seller who wins the tendered bid. Based on the re&#45;calculated value of the </font> <font face="verdana" size="2">negotiation term, the buyer and the seller can negotiate again to reach a matched offer. In the aftermath</font> <font face="verdana" size="2">negotiations, the buyer initiates and sellers respond.</font></p> 	    <p align="justify"><font face="verdana" size="2">Assume the buyer wishes to renegotiate with the seller on the attribute <i>i</i> of bid offer <i>j.</i> Then, the renegotiated bid offer</font> <font face="verdana" size="2">has the same vector form as the original offer except for the attribute <i>i</i> which is set to have a normalized value of <i>&delta;.</i></font> <font face="verdana" size="2">By multiplying the renegotiated bid offer with the weight vector and set the resultant defuzzification value equal to the </font><font face="verdana" size="2">expected value of the buyer, we can obtain the value of <i>&delta;..</i> With the inverse function in Eq.(3) or (4), the should&#45;be </font><font face="verdana" size="2">value <i>&pi;.</i> for the attribute <i>i</i> can be obtained.</font></p> 	    <p align="justify"><font face="verdana" size="2">The above procedure is straightforward and contains no computation difficulty as applied to general web&#45;sites. In </font><font face="verdana" size="2">many a case, the aftermath negotiation may take more than one round when the seller disagrees with the re-</font><font face="verdana" size="2">calculated value. In that situation, the negotiation may continue to work on other attributes or may even resort to </font><font face="verdana" size="2">other sellers. Most previous studies regarding negotiations (e.g., &#91;13&#93;&#45;&#91;14&#93;, &#91;29&#93;) are to conclude a final equilibrium</font> <font face="verdana" size="2">condition satisfied by both parties. Seldom research has been studied on aftermath negotiations until recently when</font> <font face="verdana" size="2">Leskela et al. &#91;26&#93; proposed a quantity decision support (QDS) algorithm to resolve the problem of finding no solution</font> <font face="verdana" size="2">after solving the winner determination problem (WDP) in a combinatorial reverse auction environment. However,</font> <font face="verdana" size="2">their algorithms are quite tedious and require solving at least two WDP models, which is an NP&#45;complete problem &#91;26&#93;, in a single round of negotiation. In contract, our aftermath negotiations are much simpler when encountering similar situations in reverse auctions.</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>3.3 Orientations of Negotiation Attributes</b></font></p> 	    <p align="justify"><font face="verdana" size="2">The negotiation between the buyer and seller occurs when their decision&#45;making orientations are the opposite. The</font> <font face="verdana" size="2">negotiation orientation can be divided into two scenarios. In the first scenario, a smaller value of the negotiation attribute meets the expectation of the buyer higher, while the seller expects more for the higher value of the </font><font face="verdana" size="2">negotiation attribute. For example, the buyer hopes that the price is lower, while the seller does the opposite. For</font> <font face="verdana" size="2">lower prices, the buyer perceives higher utility, and thus larger membership values, and vice versa. The seller has a</font> </p> 	    <p align="justify"><font face="verdana" size="2">membership function for price contrary to that of the buyer, where higher prices induce higher utility and larger</font> <font face="verdana" size="2">membership values. In the second scenario, higher value of the negotiation attribute meets the expectancy of the</font> <font face="verdana" size="2">buyer more, while the seller expects more for the lower value of the negotiation attribute. The attributes of quality is</font> <font face="verdana" size="2">one of the examples. If the orientation of negotiation attributes for the seller and buyer is the same, they will choose </font> <font face="verdana" size="2">a value that mutually meets the highest expectation of each other without negotiation, and the membership grade of </font><font face="verdana" size="2">the attributes has a value of 1.</font></p> 	    <p align="justify"><font face="verdana" size="2">The above discussion reveals that the negotiation attributes included in the negotiation mechanism are the ones that</font> <font face="verdana" size="2">have opposite orientation for the buyer and seller, such as price, quality (e.g., factory output quality), order due </font><font face="verdana" size="2">dates, credit rating (e.g., financial capacity, past transaction credit, etc.). Figure 3 shows the possible triangular fuzzy</font> <font face="verdana" size="2">numbers of the four negotiation attributes from the views of the buyer and the seller. This study lays emphasis on the </font><font face="verdana" size="2">discussion and construction of the negotiation mechanism, so straightforward convention is introduced for setting the </font><font face="verdana" size="2">attribute values. For ease of computation and setting, the quantitative value of the quality and credit rating is set </font><font face="verdana" size="2">between 0 and 10.</font></p> 	    ]]></body>
<body><![CDATA[<p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig23.jpg" width="315" height="462"></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="center"><font size="2" face="verdana">Figure 3: Preference orientation of the buyer and the seller</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="3"><b>4 Applying the Fuzzy Matching and Negotiation Mechanism</b></font></p> 	    <p align="justify"><font face="verdana" size="2">To demonstrate the implementation of the mechanism, in this section, we will present a negotiation matching</font> <font face="verdana" size="2">example by firstly demonstrating the matching mechanism with numbers and then showing the aftermath negotiation</font> <font face="verdana" size="2">procedures and lastly presenting a prototype of an online fuzzy negotiation system (FNS) for validation.</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>4.1 A Demonstration of the Matching Mechanism</b></font></p> 	    <p align="justify"><font face="verdana" size="2">We follows the three stages of the matching processes to demonstrate the implementation of the mechanism, where</font> <font face="verdana" size="2">the requirement values of the buyer and the terms of bid offers from sellers are assumed given.</font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><i>Stagel Setting of the requirements of the buyer</i></font></p> 	    <p align="justify"><font face="verdana" size="2">Assume the buyer requests the range of the product price (negotiation attribute i=1) is $500~750, the quality level</font> <font face="verdana" size="2">(i=2) 3~7, the due date (i=3) 5~12 days, and the credit rating (i=4) 5~9. Then the request for the buyer becomes</font></p> 	    <p align="center"><font face="verdana" size="2"><sup>	<img src="/fbpe/img/jtaer/v6n3/art07.fig24.jpg" width="363" height="16"></sup></font></p>  	    
<p align="justify"><font face="verdana" size="2">Different negotiation attributes for the buyer are weighted diversely. As was mentioned in section 2, the importance</font> <font face="verdana" size="2">levels of negotiation attributes perceived by the buyer are modeled as weights. Assume the buyer sets triangular</font> <font face="verdana" size="2">fuzzy numbers for the price as <i>W<sub>i</sub> = w</i> (0.5,0.8,0.9) , quality W<sub>2</sub> <i>= w</i> (0.4,0.6,0.7) , due date <i>W<sub>3</sub> = w</i> (0.3,0.4,0.5)</font> <font face="verdana" size="2">and credit rating W<sub>4</sub> = <i>w</i> (0.6,0.7,0.9) . Then fuzzy attribute weights are displayed as:</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig25.jpg" width="379" height="16"></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><i>Stage 2 Setting the bid offers of sellers</i></font></p> 	    <p align="justify"><font face="verdana" size="2">In this section of the example, we assume that there are three bid offers from the sellers. The first bid offer is</font> <font face="verdana" size="2">proposed by SellerA (offer j=1), in which the product price is NT$600, quality level 5, due date 7 days, and credit</font> <font face="verdana" size="2">rating 6. The bid offer of SellerA becomes <img src="/fbpe/img/jtaer/v6n3/art07.fig26.jpg" width="68" height="16"> Similarly, we assume that the bid offer from SellerB </font><img src="/fbpe/img/jtaer/v6n3/art07.fig27.jpg" width="326" height="16"></p> 	    
<p align="justify"><font face="verdana" size="2"><i>Stage3 Matching and negotiation</i></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">With Eq.(3) or (4), the negotiation terms of the bid offers from the sellers can be normalized. Take SellerA's bid offer </font><font face="verdana" size="2">as an example. Based on the buyer's requirement as described in Eq.(7), the normalized negotiation terms of</font> <font face="verdana" size="2">SellerA becomes <img src="/fbpe/img/jtaer/v6n3/art07.fig28.jpg" width="114" height="15">, which are displayed in Figure 4 with the associated fuzzy weights</font> <font face="verdana" size="2">shown in Eq.(8). Bid offer 2 from SellerB is the <img src="/fbpe/img/jtaer/v6n3/art07.fig29.jpg" width="90" height="15"> and bid offer 3 from SellerC is</font><font face="verdana" size="2"><img src="/fbpe/img/jtaer/v6n3/art07.fig30.jpg" width="84" height="16"></font></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig31.jpg" width="324" height="132"></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="center"><font face="verdana" size="2">Figure 4: Normalized terms and fuzzy weights</font></p> 	    <p align="justify"><font face="verdana" size="2">The fuzzy evaluation function of bid offer <i>j</i> on negotiation attribute <i>i,</i> denoted as<i> <img src="/fbpe/img/jtaer/v6n3/art07.fig32.jpg" width="46" height="12"></i> can be computed by </font><font face="verdana" size="2">Eq.(5); thus the four fuzzy evaluation functions of SellerA are <img src="/fbpe/img/jtaer/v6n3/art07.fig33.jpg" width="180" height="13"> , and </font><font face="verdana" size="2"><img src="/fbpe/img/jtaer/v6n3/art07.fig34.jpg" width="442" height="13"> The</font></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2">fuzzy evaluation function <img src="/fbpe/img/jtaer/v6n3/art07.fig35.jpg" width="42" height="12"> is a triangular fuzzy number, thus the sum of evaluation functions is formed by</font> <font face="verdana" size="2">adding up the corresponding apexes of the triangles. The total fuzzy evaluation value of function S</font><font face="verdana" size="2"><i>&lt;sub&gt;1&lt;/sub&gt;</i></font> <font face="verdana" size="2"> of bid offer 1 by</font> <font face="verdana" size="2">SellerA can be determined by Eq.(6) <img src="/fbpe/img/jtaer/v6n3/art07.fig36.jpg" width="206" height="11">, and is depicted in Figure</font> <font face="verdana" size="2">5. The bid offers from SellerB and SellerC can also be obtained as <img src="/fbpe/img/jtaer/v6n3/art07.fig37.jpg" width="119" height="11"> and </font><font face="verdana" size="2"><img src="/fbpe/img/jtaer/v6n3/art07.fig38.jpg" width="102" height="12">.</font></p> 	    
<p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig39.jpg" width="317" height="142"></p> 	    
]]></body>
<body><![CDATA[<p align="justify">&nbsp;</p> 	    <p align="center"><font face="verdana" size="2">Figure 5: Total fuzzy evaluation value of bid offer 1</font></p>  	    <p align="center"><font face="verdana" size="2">Table 1: Ranking of sellers' bid offers</font></p>  	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig40.jpg" width="469" height="66"></p>  	    
<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>4.2&nbsp;Conducting Aftermath Negotiations</b></font></p> 	    <p align="justify"><font face="verdana" size="2">After obtaining the results shown in Table 1, if the buyer has the lowest threshold value for the total evaluation value,</font> <font face="verdana" size="2">say 1.5, then none of the bid offer meets the requirement. After observation, if the buyer thinks the price of the bid offer by SellerC can be lower to achieve the threshold value, the buyer, with this aftermath negotiation function, can ask the seller to adjust the price without changing other attribute values and still have a total evaluation value of 1.5</font> <font face="verdana" size="2">or above.</font></p> 	    <p align="justify"><font face="verdana" size="2">For SellerC, the renegotiated bid offer is <i>j</i> = <i>adj</i><i>&lt;sub&gt;3&lt;/sub&gt;</i> (here bid offer of SellerC is 3). The normalized bid offer in vector</font> <font face="verdana" size="2">form is thus expressed by <img src="/fbpe/img/jtaer/v6n3/art07.fig47.jpg" width="82" height="17">. Substitute the weights shown in Eq.(8) and the above normalized</font> <font face="verdana" size="2">bid offer into Eq.(6), we have <img src="/fbpe/img/jtaer/v6n3/art07.fig41.jpg" width="196" height="12">. Since <i><img src="/fbpe/img/jtaer/v6n3/art07.fig42.jpg" width="57" height="11"></i> is set as 1.5,</font> <font face="verdana" size="2">from Eq. (2), <i>&delta;</i> = 0.466. Substituting <i>&delta;</i> into the inverse function in Eq.(3) or (4), the <i>should&#45;be</i> value for price <i>&pi;</i> can be </font> <font face="verdana" size="2">obtained as &pi; = $633.59.</font></p> 	    
<p align="justify"><font face="verdana" size="2">From the above demonstration regarding the matching computation, when the total evaluation value of the bid offer </font> <font face="verdana" size="2">of SellerC is adjusted to as 1.5 and other terms of attributes remain unchanged, the original price is required to be</font> <font face="verdana" size="2">lowered from $700 to $633.59, which is the highest price the buyer would negotiate with SellerC. If SellerC accepts</font> <font face="verdana" size="2">this proposition, the matching between the buyer and seller is reached; otherwise, the buyer can continue adjusting </font><font face="verdana" size="2">and negotiating or giving up the bid offer of SellerC. Of course, the buyer can negotiate with other sellers as well or </font><font face="verdana" size="2">make negotiations on other attributes, such as quality, due date or credit rating.</font></p> 	    <p align="justify">&nbsp;</p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>4.3&nbsp;A Fuzzy Negotiation System Demonstration</b></font></p> 	    <p align="justify"><font face="verdana" size="2">After presenting the development and demonstration processes of the mechanism, we constructed an online FNS as</font> <font face="verdana" size="2">a prototype of the mechanism for reverse auctions based upon the three negotiation matching stages proposed in </font><font face="verdana" size="2">this study. Developing a prototype system with simulation data is regarded as a useful evaluation process for </font><font face="verdana" size="2">verifying the effectiveness and efficiency of the mechanism built for system development &#91;19&#93;, &#91;28&#93;, &#91;37&#93;. In</font></p> 	    <p align="justify"><font face="verdana" size="2">constructing the FNS, it was observed that fuzzy computation of triangular fuzzy numbers is straightforward, so it is</font> <font face="verdana" size="2">very applicable to include fuzziness in the design of an online bidding website. The FNS website was constructed on the Microsoft Windows 2000 Server or after, and applied the Active Server Page (ASP) programming language with Microsoft Access and SQL syntax. Interested readers can access the FNS web site (Site 1).</font></p> 	    <p align="justify"><font face="verdana" size="2">Since the computation of the proposed mechanism is simple, the whole matching and negotiation processes can be </font><font face="verdana" size="2">easily applied in the website design through SQL syntax. After the FNS was constructed, we performed reverse </font><font face="verdana" size="2">auctions with simulation data for verification &#91;19&#93;, &#91;37&#93;. Figure 6 shows the matching results of the bid offers, where </font><font face="verdana" size="2">the FNS calculates the total evaluation values of the sellers' offers on the buyer's bid No.134. In the figure, bid offer </font><font face="verdana" size="2">j=8 proposed by Blue Ocean Corp. has a normalized vector form of <img src="/fbpe/img/jtaer/v6n3/art07.fig43.jpg" width="90" height="15">, and it has the largest</font> <font face="verdana" size="2">total evaluation value among all the sellers' bids of offer as 2.53. If the buyer is happy with this winning bid or if the</font> <font face="verdana" size="2">bidding conditions of the matching system stipulate that a bid concludes automatically with the highest bid offer, the </font><font face="verdana" size="2">bid is finalized as it is; otherwise, the buyer can continue to the aftermath negotiations.</font></p> 	    
<p align="justify"><font face="verdana" size="2">In the aftermath negotiations, the buyer can re&#45;negotiate with Victor Corp. of <i>j</i>=5 based on the long&#45;term cooperation </font> <font face="verdana" size="2">relationship with the company. By setting the total evaluation value of bid offer <i>j</i>=5 from 2.30 to 2.53 or bigger, and</font> <font face="verdana" size="2">selecting the "price" as the negotiation attribute, the system will come out with the adjusted price of 812,423. This </font><font face="verdana" size="2">means that if the price is reduced from 820,000 to 812,423 for the bid offer j=5, the total evaluation value becomes</font> <font face="verdana" size="2">2.53 when the values of other attributes remain unchanged. The buyer can then negotiate with Victor Corp. on bid </font><font face="verdana" size="2">offer <i>j</i>=5. Of course, the above aftermath negotiation method is applicable to the adjustment of the other bid offers</font> <font face="verdana" size="2">and/or negotiation attributes of the seller.</font></p> 	    <p align="justify"><font face="verdana" size="2">The evaluation of our proposed mechansim demonstrates its effectiveness in performing multi&#45;attribute matching and</font> <font face="verdana" size="2">negotiation for sealed&#45;bid reverse actions &#91;28&#93;, &#91;37&#93;. The construction of the FNS also shows the efficiency of our </font><font face="verdana" size="2">mechanism in applying fuzzy theories in expressing the vagueness of human judgment and preferences as attributes </font><font face="verdana" size="2">for the matching of bid offers &#91;28&#93;, &#91;37&#93;.</font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="center"><img src="/fbpe/img/jtaer/v6n3/art07.fig44.jpg" width="375" height="221"></p> 	    
<p align="center"><font face="verdana" size="2">Figure 6: FNS matching results of bid offers</font></p> 	    <p align="center">&nbsp;</p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="3"><b>5 Conclusions and Suggestions</b></font></p> 	    <p align="justify"><font face="verdana" size="2">The extensive application of electronic commerce enables enterprises to reduce the transaction cost via Internet&#45;</font><font face="verdana" size="2">based trading activities and to improve the operational efficiency (e.g., &#91;1&#93;, &#91;3&#93;&#45;&#91;4&#93;, &#91;16&#93;, &#91;23&#93;). However, the</font> <font face="verdana" size="2">transactions between enterprises are complicated. The seller and buyer need to evaluate and negotiate with each</font> <font face="verdana" size="2">other and consider many factors during the transaction, so as to conclude a mutually beneficial agreement. The rapid</font> <font face="verdana" size="2">development of online reverse auction is attributed to the price&#45;saving effect experienced by the buyer and seller and</font> <font face="verdana" size="2">the improvement in the transaction processes. However, previous research also shows that the online reverse </font><font face="verdana" size="2">auction may result in negative evaluations, and may affect the long&#45;term cooperation relationship between the seller </font><font face="verdana" size="2">and buyer &#91;8&#93;&#45;&#91;9&#93;, &#91;16&#93;, &#91;22&#93;. Daly and Nath &#91;81&#45;&#91;91 suggested that online reverse auction systems could be designed</font> <font face="verdana" size="2">to meet the needs of the long&#45;term investment and business relationship between enterprise partners, such as the</font> <font face="verdana" size="2">subsidization for the cooperative partnership or the bidding loss, or even providing the mechanism for re&#45;negotiating</font> <font face="verdana" size="2">the final bid prices and specifications.</font></p> 	    <p align="justify"><font face="verdana" size="2">In industry application, direct input goods and outsourcing of engineering projects account for the major amount of business purchasing costs &#91;6&#93;, &#91;10&#93;, &#91;33&#93;. However, previous research was mostly conducted in an open&#45;cry and multiple rounds of auctions, which is applicable to indirect input goods like MRO types of goods and is not appropriate for direct input goods &#91;2&#93;, &#91;5&#93;&#45;&#91;6&#93;, &#91;10&#93;. The auctioneer and the bidders for indirect input goods are self&#45;interested and the negotiation process usually involves multiple rounds. To reach an agreement in a reasonable time, both parties may set up a negotiation protocol to deal with this competitive situation with a discount factor for one additional round of negotiation &#91;13&#93;&#45;&#91;14&#93;, &#91;29&#93;. Moreover, in some cases, the negotiation process may not conclude with any results &#91;13&#93;, &#91;29&#93;.This study develops a fuzzy multi&#45;attribute mechanism that the matching of sealed&#45;bids is completed in a single round. In addition to the price attribute, the negotiation attributes of quality, due dates, and credit rating, which may affect the matching, are considered as well. The total evaluation values of the bid offers are found through the fuzzy matching mechanism with simple arithmetic operations which can be easily embedded in a reverse auction website. Since this mechanism is suitable for direct input goods, both the auctioneer and the bidders work in a cooperative manner (of course, among bidders, it is still in a competitive manner) with a hope to maintain the long&#45;term relationship that is not easily built &#91;8&#93;&#45;&#91;9&#93;, &#91;25&#93;. Besides the attributes considered in the reverse auction, time accuracy and delivery assurance resulted from the process of reverse auctions are also major concerns for direct input goods because they affect the operations of production lines directly. Our aftermath negotiation is established to allow the buyer to flexibly negotiate with sellers on bid offers to speed up the reverse auction process and to assure arriving at a conclusion. In addition, the aftermath negotiation is conducted on the basis of cooperation and trust between the two parties to create a win&#45;win situation, which differentiates our research from those studies based on self&#45;interested negotiation parties.</font></p> 	    <p align="justify"><font face="verdana" size="2">Practitioners can easily construct a sealed&#45;bid reverse auction system for procuring their direct input goods in a fuzzy </font><font face="verdana" size="2">setting following the matching process and the aftermath negotiations exhibited in section 3.1 and 3.2. The FNS</font> <font face="verdana" size="2">shown in section 4.3 is a prototype system for this purpose and is developed with fundamental software that is</font> <font face="verdana" size="2">available handily. By developing the FNS, our proposed mechanism is evaluated through building a prototype</font> <font face="verdana" size="2">system and through performing some simulation studies for reverse auctions &#91;19&#93;, &#91;28&#93;, &#91;37&#93;. For the existing </font><font face="verdana" size="2">procurement system of a company, either the buy&#45;side or the neutral e&#45;marketplace system, our model can also be</font> <font face="verdana" size="2">readily appended to since the coding required for our mechanism is straightforward without resorting to specialty </font><font face="verdana" size="2">software for complex computation.</font></p> 	    <p align="justify"><font face="verdana" size="2">The mechanism developed in this study utilizes negotiation attributes to arrive at an evaluation value for bid ranking,</font> <font face="verdana" size="2">and those negotiation attributes represent the specifications of bids and should be transformed numerically before being implemented in the mechanism. For standardized products of direct input goods, specifications can be easily transformed into numerals. However, for non&#45;standardized products, specifications are variant and usually cannot be handily converted into numerals in an allowable time during the procurement process, and this limits their application to our mechanism.</font></p> 	    <p><font face="verdana" size="2">Even this fuzzy negotiation mechanism is derived in the B2B online reverse auctions, it can be easily converted to be</font> <font face="verdana" size="2">applied in B2C and C2C matching processes. For example, this mechanism can be used in B2C matching</font> <font face="verdana" size="2">operations such as the house rental or real estate services, the car rental or sale services, the travel scheduling, etc.;</font> <font face="verdana" size="2">it can be used in C2C matching operations like personal stuffs auctions or bidding. In addition, if the roles of the </font> <font face="verdana" size="2">buyer and seller are interchanged such that a single seller is the bid setter, and numerous buyers offer the bids, then</font> <font face="verdana" size="2">this reverse auction system becomes an auction system.</font></p> 	    <p align="justify"><font face="verdana" size="3"><b>Websites List</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Site 1: Fuzzy Negotiation System <a href="http://140.130.128.90/ec/fns" target="_blank"><u>http://140.130.128.90/ec/fns</u></a></font></p>  	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>References</b></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93; U. Arnold, H. Karner, and M. Schnabel, Target&#45;oriented use of strategic sourcing tools: A critical analysis</font> <font face="verdana" size="2">crating process awareness for electronic reverse auctions, Journal of Purchasing and Supply Management, vol.</font> <font face="verdana" size="2">11, no. 2&#45;3, pp. 116&#45;128, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700001&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;2&#93; M. Bichler and J. Kalagnanam, Configurable offers and winner determination in multi&#45;attribute auctions,</font> <font face="verdana" size="2">European Journal of Operational Research, vol. 160, no. 2, pp. 380&#45;394, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700002&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;3&#93; J. Carbone, Debate rages over use of e&#45;auction for components, Purchasing, vol. 132, no. 19, pp. 48&#45;52, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700003&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; C. R. Carter, L. Kaufmann, S. Beall, P. L. Carter, T. E. Hendrick, and K. J. Petersen, Reverse auctions &#45;</font> <font face="verdana" size="2">grounded theory from the buyer and supplier perspective, Transportation Research Part E: Logistics and</font> <font face="verdana" size="2">Transportation Review, vol. 40, no. 3, pp. 229&#45;254, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700004&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; S. C. Chang, Reverse electronic auctions: Cases in Taiwan's high&#45;tech industry, Technology in Society, vol. 29,</font> <font face="verdana" size="2">no. 4, pp. 490&#45;496, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700005&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; C. B. Cheng, Solving a sealed&#45;bid reverse auction problem by multiple&#45;criterion decision&#45;making methods, Computers and Mathematics with Applications, vol. 56, no. 12, pp. 3261&#45;3274, 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700006&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; C. B. Cheng, C. H. Chan, and K. C. Lin, Intelligent agents for e&#45;marketplace: Negotiation with issue trade&#45;offs by fuzzy inference systems, Decision Support Systems, vol. 42, no. 2, pp. 626&#45;638, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700007&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; S. P. Daly and P. Nath, Reverse auctions for relationship marketers, Industrial Marketing Management, vol. 34, no. 2, pp. 157&#45;166, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700008&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; S. P. Daly and P. Nath, Reverse auctions and buyer &#45; seller relationships: A rejoinder to Emiliani and Stec's</font> <font face="verdana" size="2">commentary, Industrial Marketing Management, vol. 34, no. 2, pp. 173&#45;176, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700009&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;10&#93; E. David, R. Azoulay&#45;Schwartz, and S. Kraus, Bidding in sealed&#45;bid and English multi&#45;attribute auctions,</font> <font face="verdana" size="2">Decision Support Systems, vol. 42, no. 2, pp. 527&#45;556, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700010&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93; V. Ervasti and R.&#45;L. Leskela, Allocative efficiency in simulated multiple&#45;unit combinatorial auctions with quantity</font> <font face="verdana" size="2">support, European Journal of Operational Research, vol. 203, no. 1, pp. 251&#45;260, 2010.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700011&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; M. L. Emiliani, Regulating B2B online reverse auctions through voluntary codes of conduct, Industrial Marketing</font> <font face="verdana" size="2">Management, vol. 34, no. 5, pp. 526&#45;534, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700012&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; S. S. Fatima, M. Wooldridge, and N. R. Jennings, A comparative study of game theoretic and evolutionary</font> <font face="verdana" size="2">models of bargaining for software agents, Artificial Intelligence Review, vol. 23, no. 2, pp. 185&#45;203, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700013&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; S. S. Fatima, M. Wooldridge, and N. R. Jennings, Multi&#45;issue negotiation with deadlines, Journal of Artificial</font> <font face="verdana" size="2">Intelligence Research, vol. 27, no. 1, pp. 381&#45;417, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700014&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; A. Foroughi, M. Kocakulah, and J. Williams, A framework for electronic reverse auction (eRA) research, Journal</font> <font face="verdana" size="2">of Internet Commerce, vol. 6, no. 3, pp. 45&#45;74, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700015&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; T. F. Gattiker, X. Huang, and J. L. Schwarz, Negotiation, email, and Internet reverse auctions: How sourcing</font> <font face="verdana" size="2">mechanisms deployed by buyers affect suppliers' trust, Journal of Operations Management, vol. 25, no. 1, pp.</font> <font face="verdana" size="2">184&#45;202, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700016&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; W. Grey, T. Olavson, and D. Shi, The role of e&#45;marketplaces in relationship&#45;based supply chains: A survey, IBM</font> <font face="verdana" size="2">Systems Journal, vol. 44, no. 1, pp. 109&#45;123, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700017&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; X. Gu and Q. Zhu, Fuzzy multi&#45;attribute decision&#45;making method based on eigenvector of fuzzy attribute</font> <font face="verdana" size="2">evaluation space, Decision Support Systems, vol. 41, no. 2, pp. 400&#45;410, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700018&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; A. R. Hevner, S. T. March, and J. Park, Design science in information systems research, MIS Quarterly, vol. 28,</font> <font face="verdana" size="2">no. 1, pp. 75&#45;105, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700019&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;20&#93; C. L. Hwang and K. Yoon, Multiple Attribute Decision Making, Methods and Applications &#45; A State&#45;of&#45;the&#45;Art</font> <font face="verdana" size="2">Survey. New York, NY: Springer&#45;Verlag, 1981.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700020&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;21&#93; J. S. Jang, C. T. Sun, and E. Mizutani, Neuro&#45;Fuzzy and Soft Computing: A Computational Approach to</font> <font face="verdana" size="2">Learning and Machine Intelligence. Upper Saddle River, NJ: Prentice&#45;Hall, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700021&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;22&#93; S. D. Jap, Online eRAs: Issues, themes, and prospects for the future, Journal of the Academy of Marketing</font> <font face="verdana" size="2">Science, vol. 30, no. 4, pp. 45&#45;74, 2002.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700022&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;23&#93; M. Jin and S. D. Wu, Supplier coalitions in on&#45;line reverse auction: Validity requirements and profit distribution</font> <font face="verdana" size="2">scheme, International Journal of Production Economics, vol. 100, no. 2, pp. 183&#45;194, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700023&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;24&#93; J. G. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications. Upper Saddle River, NJ: Prentice</font> <font face="verdana" size="2">Hall, 1995.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700024&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;25&#93; N. Kumar, L. Scheer, and J. B. Steenkamp, The effects of supplier fairness on vulnerable resellers, Journal of</font> <font face="verdana" size="2">Marketing Research, vol. 32, no. 1, pp. 54&#45;65, 1995.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700025&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;26&#93; R.&#45;L. Leskela, J. Teich, H. Wallenius, and J. Wallenius, Decision support for multi&#45;unit combinatorial bundle</font> <font face="verdana" size="2">auctions, Decision Support Systems, vol. 43, no. 2, pp. 420&#45;434, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700026&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;27&#93; F. Nassiri&#45;Mofakham, M. A. Nematbakhsh, N. Ghasem&#45;Aghaee, and A. Baraani&#45;Dastjerdi, A heuristic</font> <font face="verdana" size="2">personality&#45;based bilateral multi&#45;issue bargaining model in electronic commerce, International Journal of</font> <font face="verdana" size="2">Human&#45;Computer Studies, vol. 67, no. 1, pp. 1&#45;35, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700027&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;28&#93; K. Peffers, T. Tuunanen, M. A. Rothenberger, and S. Chatterjee, A design science research methodology for</font> <font face="verdana" size="2">information systems research, Journal of Management Information Systems, vol. 24, no. 3, pp. 45&#45;77, 2007 </font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700028&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;29&#93; S. D. Ramchurn, C. Sierra, L. Godo, and N. R. Jennings, Negotiating using rewards, Artificial Intelligence, vol.</font> <font face="verdana" size="2">171, no. 10&#45;15, pp. 805&#45;837, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700029&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;30&#93; D.&#45;H. Shih, S.&#45;Y. Huang, and D. C. Yen, A new reverse auction agent system for m&#45;commerce using mobile</font> <font face="verdana" size="2">agents, Computer Standards and Interfaces, vol. 27, no. 4, pp. 383&#45;395, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700030&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;31&#93; A. Smart and A. Harrison, Reverse auctions as a support mechanism in flexible supply chains, International</font> <font face="verdana" size="2">Journal of Logistics, vol. 5, no. 3, pp. 275&#45;284, 2002.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700031&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;32&#93; J. E. Teich, H. Wallenius, J. Wallenius, and O. R. Koppius, Emerging multiple issue e&#45;auctions, European</font> <font face="verdana" size="2">Journal of Operational Research, vol. 159, no. 1, pp. 1&#45;16, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700032&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;33&#93; J. E. Teich, H. Wallenius, J. Wallenius, and A. Zaitsev, A multi&#45;attribute e&#45;auction mechanism for procurement:</font> <font face="verdana" size="2">theoretical foundations, European Journal of Operational Research, vol. 175, no. 1, pp. 90&#45;100, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700033&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;34&#93; F. Teuteberg, Experimental evaluation of a model for multilateral negotiation with fuzzy preferences on an</font> <font face="verdana" size="2">agent&#45;based marketplace, Electronic Markets, vol. 13, no. 1, pp. 21&#45;32, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700034&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"> &#91;35&#93; R. Wang, Bidding and renegotiation in procurement auctions, European Economic Review, vol. 44, no. 8, pp.</font> <font face="verdana" size="2">1577&#45;159, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700035&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;36&#93; Y. Wang, K. L. Tan, and J. Ren, PumaMart: A parallel and autonomous agents based Internet marketplace,</font> <font face="verdana" size="2">Electronic Commerce Research and Applications, vol. 3, no. 3, pp. 294&#45;310, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700036&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --> </font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;37&#93; J.&#45;H Wu, A design methodology for form&#45;based knowledge reuse and representation, Information &amp;</font> <font face="verdana" size="2">Management, vol. 46, no. 7, pp. 365&#45;375, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0718-1876201100030000700037&pid=S0718-18762011000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p> 	<hr> 	    <p align="justify"><font face="verdana" size="2">Received 10 November 2010; received in revised form 7 March 2011; accepted 26 April 2011</font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arnold]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Karner]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Schnabel]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Target-oriented use of strategic sourcing tools: A critical analysis crating process awareness for electronic reverse auctions]]></article-title>
<source><![CDATA[Journal of Purchasing and Supply Management]]></source>
<year>2005</year>
<volume>11</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>116-128</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bichler]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kalagnanam]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Configurable offers and winner determination in multi-attribute auctions]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2005</year>
<volume>160</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>380-394</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carbone]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Debate rages over use of e-auction for components]]></article-title>
<source><![CDATA[Purchasing]]></source>
<year>2003</year>
<volume>132</volume>
<numero>19</numero>
<issue>19</issue>
<page-range>48-52</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[C. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kaufmann]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Beall]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[P. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hendrick]]></surname>
<given-names><![CDATA[T. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Petersen]]></surname>
<given-names><![CDATA[K. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reverse auctions - grounded theory from the buyer and supplier perspective, Transportation Research Part E]]></article-title>
<source><![CDATA[Logistics and Transportation Review]]></source>
<year>2004</year>
<volume>40</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>229-254</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reverse electronic auctions: Cases in Taiwan's high-tech industry]]></article-title>
<source><![CDATA[Technology in Society]]></source>
<year>2007</year>
<volume>29</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>490-496</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[C. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Solving a sealed-bid reverse auction problem by multiple-criterion decision-making methods]]></article-title>
<source><![CDATA[Computers and Mathematics with Applications]]></source>
<year>2008</year>
<volume>56</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>3261-3274</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[C. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Chan]]></surname>
<given-names><![CDATA[C. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[K. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Intelligent agents for e-marketplace: Negotiation with issue trade-offs by fuzzy inference systems]]></article-title>
<source><![CDATA[Decision Support Systems]]></source>
<year>2006</year>
<volume>42</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>626-638</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daly]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Nath]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reverse auctions for relationship marketers]]></article-title>
<source><![CDATA[Industrial Marketing Management]]></source>
<year>2005</year>
<volume>34</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>157-166</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daly]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Nath]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reverse auctions and buyer - seller relationships: A rejoinder to Emiliani and Stec's commentary]]></article-title>
<source><![CDATA[Industrial Marketing Management]]></source>
<year>2005</year>
<volume>34</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>173-176</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[David]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Azoulay-Schwartz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kraus]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Bidding in sealed-bid and English multi-attribute auctions]]></article-title>
<source><![CDATA[Decision Support Systems]]></source>
<year>2006</year>
<volume>42</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>527-556</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ervasti]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Leskela]]></surname>
<given-names><![CDATA[R.-L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>203</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>251-260</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Emiliani]]></surname>
<given-names><![CDATA[M. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Regulating B2B online reverse auctions through voluntary codes of conduct]]></article-title>
<source><![CDATA[Industrial Marketing Management]]></source>
<year>2005</year>
<volume>34</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>526-534</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fatima]]></surname>
<given-names><![CDATA[S. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wooldridge]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jennings]]></surname>
<given-names><![CDATA[N. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A comparative study of game theoretic and evolutionary models of bargaining for software agents]]></article-title>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>2005</year>
<volume>23</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>185-203</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fatima]]></surname>
<given-names><![CDATA[S. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wooldridge]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jennings]]></surname>
<given-names><![CDATA[N. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multi-issue negotiation with deadlines]]></article-title>
<source><![CDATA[Journal of Artificial Intelligence Research]]></source>
<year>2006</year>
<volume>27</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>381-417</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Foroughi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kocakulah]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A framework for electronic reverse auction (eRA) research]]></article-title>
<source><![CDATA[Journal of Internet Commerce]]></source>
<year>2007</year>
<volume>6</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>45-74</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gattiker]]></surname>
<given-names><![CDATA[T. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwarz]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Negotiation, email, and Internet reverse auctions: How sourcing mechanisms deployed by buyers affect suppliers' trust]]></article-title>
<source><![CDATA[Journal of Operations Management]]></source>
<year>2007</year>
<volume>25</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>184-202</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grey]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Olavson]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The role of e-marketplaces in relationship-based supply chains: A survey]]></article-title>
<source><![CDATA[IBM Systems Journal]]></source>
<year>2005</year>
<volume>44</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>109-123</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fuzzy multi-attribute decision-making method based on eigenvector of fuzzy attribute evaluation space]]></article-title>
<source><![CDATA[Decision Support Systems]]></source>
<year>2006</year>
<volume>41</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>400-410</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hevner]]></surname>
<given-names><![CDATA[A. R.]]></given-names>
</name>
<name>
<surname><![CDATA[March]]></surname>
<given-names><![CDATA[S. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Design science in information systems research]]></article-title>
<source><![CDATA[MIS Quarterly]]></source>
<year>2004</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-105</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[C. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yoon]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Multiple Attribute Decision Making, Methods and Applications - A State-of-the-Art Survey]]></source>
<year>1981</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jang]]></surname>
<given-names><![CDATA[J. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[C. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Mizutani]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Upper Saddle River^eNJ NJ]]></publisher-loc>
<publisher-name><![CDATA[Prentice-Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jap]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Online eRAs: Issues, themes, and prospects for the future]]></article-title>
<source><![CDATA[Journal of the Academy of Marketing Science]]></source>
<year>2002</year>
<volume>30</volume>
<numero>^s4</numero>
<issue>^s4</issue>
<supplement>4</supplement>
<page-range>45-74</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Supplier coalitions in on-line reverse auction: Validity requirements and profit distribution scheme]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2006</year>
<volume>100</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>183-194</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klir]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Yuan]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fuzzy Sets and Fuzzy Logic: Theory and Applications]]></source>
<year>1995</year>
<publisher-loc><![CDATA[Upper Saddle River^eNJ NJ]]></publisher-loc>
<publisher-name><![CDATA[Prentice Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Scheer]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Steenkamp]]></surname>
<given-names><![CDATA[J. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The effects of supplier fairness on vulnerable resellers]]></article-title>
<source><![CDATA[Journal of Marketing Research]]></source>
<year>1995</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>54-65</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leskela]]></surname>
<given-names><![CDATA[R.-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Teich]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Decision support for multi-unit combinatorial bundle auctions]]></article-title>
<source><![CDATA[Decision Support Systems]]></source>
<year>2007</year>
<volume>43</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>420-434</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nassiri-Mofakham]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Nematbakhsh]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghasem-Aghaee]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Baraani-Dastjerdi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[heuristic personality-based bilateral multi-issue bargaining model in electronic commerce]]></article-title>
<source><![CDATA[International Journal of Human-Computer Studies]]></source>
<year>2009</year>
<volume>67</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-35</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peffers]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tuunanen]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Rothenberger]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chatterjee]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A design science research methodology for information systems research]]></article-title>
<source><![CDATA[Journal of Management Information Systems]]></source>
<year>2007</year>
<volume>24</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>45-77</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ramchurn]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sierra]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Godo]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Jennings]]></surname>
<given-names><![CDATA[N. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Negotiating using rewards]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2007</year>
<volume>171</volume>
<numero>10-15</numero>
<issue>10-15</issue>
<page-range>805-837</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shih]]></surname>
<given-names><![CDATA[D.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Yen]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new reverse auction agent system for m-commerce using mobile agents]]></article-title>
<source><![CDATA[Computer Standards and Interfaces]]></source>
<year>2005</year>
<volume>27</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>383-395</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Smart]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Harrison]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reverse auctions as a support mechanism in flexible supply chains]]></article-title>
<source><![CDATA[International Journal of Logistics]]></source>
<year>2002</year>
<volume>5</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>275-284</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teich]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Koppius]]></surname>
<given-names><![CDATA[O. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Emerging multiple issue e-auctions]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2004</year>
<volume>159</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-16</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teich]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallenius]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zaitsev]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A multi-attribute e-auction mechanism for procurement: theoretical foundations]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>175</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>90-100</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teuteberg]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Experimental evaluation of a model for multilateral negotiation with fuzzy preferences on an agent-based marketplace]]></article-title>
<source><![CDATA[Electronic Markets]]></source>
<year>2003</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-32</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Bidding and renegotiation in procurement auctions]]></article-title>
<source><![CDATA[European Economic Review]]></source>
<year>2007</year>
<volume>44</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1577-159</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Tan]]></surname>
<given-names><![CDATA[K. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ren]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[PumaMart: A parallel and autonomous agents based Internet marketplace]]></article-title>
<source><![CDATA[Electronic Commerce Research and Applications]]></source>
<year>2004</year>
<volume>3</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>294-310</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[H Wu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A design methodology for form-based knowledge reuse and representation]]></article-title>
<source><![CDATA[Information & Management]]></source>
<year>2009</year>
<volume>46</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>365-375</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
