Scielo RSS <![CDATA[Journal of theoretical and applied electronic commerce research]]> vol. 11 num. 1 lang. es <![CDATA[SciELO Logo]]> <![CDATA[<strong>Impact of Information and Communication Technology to the Competitiveness of European Countries - Cluster Analysis Approach</strong>]]> <![CDATA[<strong>A Multi-Attribute Auction Mechanism based on Conditional Constraints and Conditional Qualitative Preferences</strong>]]> Auctioning multi-dimensional items is a key challenge, which requires rigorous tools. This study proposes a multi-round, first-score, semi-sealed multi-attribute reverse auction system. A fundamental concern in multiattribute auctions is acquiring a useful description of the buyers' individuated requirements: hard constraints and qualitative preferences. To consider real requirements, we express dependencies among attributes. Indeed, our system enables buyers eliciting conditional constraints as well as conditional preferences. However, determining the winner with diverse criteria may be very time consuming. Therefore, it is more useful for our auction to process quantitative data. A challenge here is to satisfy buyers with more facilities, and at the same time keep the auctions efficient. To meet this challenge, our system maps the qualitative preferences into a multi-criteria decision rule. It also completely automates the winner determination since it is a very difficult task for buyers to estimate quantitatively the attribute weights and define attributes value functions. Our procurement auction looks for the outcome that satisfies all the constraints and best matches the preferences. We demonstrate the feasibility and measure the time performance of the proposed system through a 10-attribute auction. Finally, we assess the user acceptance of our requirements specification and winner selection tool. <![CDATA[<strong>A Service-Oriented E-Commerce Reference Architecture</strong>]]> Electronic commerce (e-commerce) is getting more and more important in people's every day shopping routines. Vendors who want to establish an online channel besides their traditional retail practice have to integrate the two supply chains. The underlying information technology systems should be able to support the integration of the new and old processes. While reference models are a popular means in designing this type of systems, the existing reference models in the field of e-commerce only give insight into the business processes and ignore the entire enterprise architecture. In this paper we address the lack of such a comprehensive reference architecture. Based on a systematic literature review, on current trends, and best practices in ecommerce landscapes we derive a reference model for service-oriented e-commerce architectures. The proposed architecture integrates new business partners and customers into the internal processes. <![CDATA[<strong>Safeguarding Buyers with Attack-Resilient Reputation Parameters</strong>]]> Agent-mediated reputation systems provide the necessary decision making support to facilitate the automation of processes, and to improve the quality of services in an information asymmetric e-market. Reputation systems encourage honest behavior and discourage malicious behavior of buyer and seller agents by safeguarding honest participants and by laying a foundation for security through social control mechanisms. In this paper, we propose a reputation system that aims to safeguard honest buyers from rogue behavior by counterparties and deceptive buying peers. It employs reputation functions with attack-resilient parameters based on the e-market parameters like value of the transaction and varying experience of agents.These parameters help to reduce the incentive for dishonest behavior, and to minimize harm in case of attacks by rogue sellers in order to improve the trustworthiness among participants in the e-market. <![CDATA[<strong>Personality Type Effects on Perceptions of Online Credit Card Payment Services</strong>]]> Credit cards and the subsequent payment of credit card debt play a crucial role in e-commerce transactions. While website design effects on trust and e-commerce have been studied, these are usually coarse grained models. A more individualized approach to utilization of online credit card payment services is examined that utilizes personality as measured by the Myers-Briggs personality type assessment to determine variances in perception of online payment service features. The results indicate that certain overriding principles appear to be largely universal, namely security and efficiency (or timeliness) of the payment system. However there are differences in the perceived benefit of these features and other features between personality types, which may be capitalized upon by payment service providers to attract a broader base of consumers and maintain continuance of existing users. <![CDATA[<strong>Constraint based Interesting Location and Mobile Web Service Sequence Mining in M-Commerce Environment</strong>]]> Recently, mobile web services have become a more emerging topic due to popularity of smart phones and laptops. Mobile web services are becoming popular because the growth of internet speeds. Mobile web service is not only useful for particular user, but also for business purposes. It is useful for growth of a particular business. For a particular business, it is important to have the knowledge of user's interest. In M-commerce environment user's interesting web service sequence mining is also an emerging topic now a day. If a business person knows the web service accessing sequence of any user, he can plan new information for that particular user. Today, user's web service accessing sequence mining is based on type of service, visiting locations, timing and some specific constraints. The constraint may define the importance or utility of a particular web service. Here, we consider utility based constraint for particular user in M-commerce environment. We proposed an efficient approach, namely Mobile Web Service Sequence Mining to mine utility based user's interesting web service accessing sequence. Experimental results show that the proposed approach is better than previous constraint based approaches.