• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.955-962
• /
• 2002

Commercial internet auction systems have been successfully used recently. In those systems, because reserve prices of auction items are given by sellers only, the success bid rate can be decreased due to the large difference between the reserve price and the normal price. In this paper, we propose an agent that generates reserve prices to sellers based on past auction data and item prices gathered from the web. Through performance experiments, we show that the successful bid rate increases by preventing sellers from making unreasonable reserve prices. Using the pricing agent, we design and implement an XML-based auction system on the web.

• The Journal of Society for e-Business Studies
• /
• v.9 no.2
• /
• pp.17-31
• /
• 2004

It is very important that sellers provide reasonable reserve prices for auction items in internet auction systems. Recently, an agent has been proposed to generate reserve prices automatically based on the case similarity of information retrieval theory. However, one of its drawbacks is that the recent trend of auction prices is not reflected in the generated reserve prices, because it suggests the bid price of the most similar item from the past auction data. In this paper, in order to overcome the problem, we propose a new method that generates reserve prices based on the moving average of time series analysis, in which more weight is provided to the recent bid prices. Through performance experiments, we show that the successful bid rate can be increased by preventing sellers from making unreasonable reserve prices.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.11a
• /
• pp.295-304
• /
• 2002

This case describes key development challenges and patterns as experienced by Internet Auction Company, Ltd. from the startup stage through IPO to the sale to eBay. Currently an eBay company, Internet Auction Co. continues to pursue new auction systems and substitute distribution systems for the future with a renewed entrepreneurial spirit. In 1997, Mr Hyuk Oh saw a business opportunity in the Internet allowing two-way communications. At that time, the success stories of eBay and Onsale in the United States were good stimuli to his startup of an auction site. He opened the Website in April 1, 1998 after four months of development efforts. Auction has merit more than other shopping malls. First, it brings about interesting and benefit. Second, it has interactive trade system. Third, customers will trade for reasonable price through direct own will of them. Fourth, Auction's model brings about multitude sale through aggressive sales. Even if Network Marketing has socially negative effect in case of inappropriate use, it is good mood for further business. In case E-Commerce use as useful purpose, it will have competitive priority revenue model.

• Journal of Family Resource Management and Policy Review
• /
• v.11 no.2
• /
• pp.133-154
• /
• 2007

This research investigated consumer's usage of, evaluation on and satisfaction of the Auction Site, with a view to analyze the key factors influencing a commission paid Auction Site. The findings of results from the analysis are summarized as follows. First of all, the consumer group at the age equal to and less than 20 years old showed the highest purchasing frequency, and the consumer group with a household income less than 2,500,000 won showed the highest number of hours on the site. Secondly, the evaluation index showed that consumers think highly of the complaint resolution process, and, especially, the aged consumer group respected the Auction Site's level of confidentiality of transaction and privacy. Thirdly, among consumers' satisfaction, subdivided by types, price satisfaction was the highest followed by quality satisfaction, settlement satisfaction, delivery satisfaction, information satisfaction and AS satisfaction, in that order. Fourthly, in the event consumers used the commission paid Auction Site, the number of times it has been used, evaluations related to information provision and evaluations on confidentiality of transactions and privacy are influential parameters.

• Korean Management Science Review
• /
• v.21 no.2
• /
• pp.273-289
• /
• 2004

Although the Internet is useful for transferring information, Internet auction environments make fraud more attractive to offenders, because the chance of detection and punishment is decreased. One of these frauds is the phantom transaction, which is a colluding transaction by the buyer and seller to commit the illegal discounting of a credit card. They pretend to fulfill the transaction paid by credit card, without actually selling products, and the seller receives cash from the credit card corporations. Then the seller lends it out with quite a high interest rate to the buyer, whose credit rating is so poor that he cannot borrow money from anywhere else. The purpose of this study is to empirically investigate the factors necessary to detect phantom transactions in an online auction. Based upon studies that have explored the behaviors of buyers and sellers in online auctions, the following have been suggested as independent variables: bidding numbers, bid increments, sellers' credit, auction lengths, and starting bids. In this study. we developed Internet-based data collection software and collected data on transactions of notebook computers, each of which had a winning bid of over W one million. Data analysis with a logistic regression model revealed that starting bids, sellers' credit, and auction length were significant in detecting the phantom transactions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.1
• /
• pp.60-64
• /
• 2007

Recently, real time auction system is increasingly required as internet grows up. According to this social requirement change, this paper designed and implemented a real time auction system. The system registers the goods for auction which customers add to their interested list in their point of view, automatically responds their information and gives a chance to the customer to apply to auction immediately via internet, and performs registration such as customer's information, goods, interested goods, etc. And, the customers on the system can purchase their interested goods rapidly and easily by check-up service of their interested and auctioned products without regarding to place or time through a mobile terminal.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.3-15
• /
• 2002

In this paper, we propose an efficient and secure sealed-bid auction protocol with two servers, a seller S and a third party A . The proposed scheme uses the idea of the conditional oblivious transfer protocol proposed by Crescenzo-Ostrovskey-Rajagopalan. A server A is not a trusted third party, but is assumed not to collude with a server S. In the proposed auction protocol, barring collusion between A and S, neither party gains any information about the bids, and moreover, the outcome of the auction will be correct. And the computational complexity of our auction protocol is considerably efficient and the communication overhead is similar to that of Naor-Pinkas-Sumner's scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.11-18
• /
• 2009

In this paper, a hierarchical link allocation algorithm between mobile stations (MSs) and the corresponding base station (BS) by an optimal utilization of relay stations (RSs) is proposed to improve throughput of RS systems. In the proposed hierarchical algorithm, each RS operates cognitive radio functions to sense the degree of satisfaction in the quality of services (QoSs) and then selects the candidate set of MSs to have links with the RS. Such information is reported to the BS, where an auction process is performed to get an optimal allocation of communication links between the MSs and the BS. To maximize system throughput, the proposed auction algorithm is conducted upon bidding prices of communication links, considering both the co-channel interference (CCI) information shared among adjacent cells and the QoS enhancement information for each MS collected from RSs. The BS then switches the communication links of the auction winner MSs through the corresponding RS. The computer simulation shows that the proposed algorithm enhances the user QoS more than the conventional algorithm, especially for RS systems with more users requiring higher QoS. The proposed algorithm has also been proved to have more robust performance than the conventional one when the traffic load is higher and the CCI becomes stronger.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.963-970
• /
• 2002

In this paper, after defining the requirements to improve the processing of Internet auction, we design and implement Internet Auction Agent System (IAAS) based on the requirements. IAAS consists of a multi - agent system with buying/selling/negotiation agents for auction processing in accordance with the given price strategy, a graphic interface for supporting price strategies, an information agent for supplying real time information and remote control of agents, and DB. For the mobility, scalability, functionality and communication efficiency of agents, IAAS is implemented by using Java JDK1.3, Servlet, RMI and socket. Through the comparative analysis, we show that IAAS fulfills the requirements defined. IAAS can improve the convenience of users and the efficiency of auction processing, and thus increase the utilization of Internet auction.

• Horticultural Science & Technology
• /
• v.29 no.6
• /
• pp.641-644
• /
• 2011

A new standard red color gerbera (Gerbera hybrida Hort.) 'Red Auction' was developed from a cross of '01-120-195' and 'Misty red' followed by seedling and line selections at the Flower Research Institute, Gyeongsangnam-do Agricultural Research & Extension Services (ARES) in 2008. Characteristics trials were conducted three times from 2006 to 2008. 'Red Auction' has semi-double type in good harmony with red color (RHS 45-A) ray floret and a good stable flower shape and strong peduncle. Its vase life was 11.3 days. The average yield of 'Red Auction' was 48.8 flowers per plant a year in greenhouse yield trials carried out from 2006 to 2008. This cultivar registered for commercialization in 2010.