• Title/Summary/Keyword: Auction System

Search Result 183, Processing Time 0.021 seconds

Design & Realization of Realtime Auction System (실시간 경매 시스템의 설계 및 구현)

  • Lee Ki-Hwan;Lim Dong-Kyun
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.228-233
    • /
    • 2005
  • Recently, there are requires for auction system by growing up internet. This paper says if the customers add wonted goods to wanted list, the system automatically announce information to the customer via Inter Web browsing, whenever the proper goods to register to the auction system by seller. The system provides registration customer information, registration goods, wanted goods. And the application program can be downloaded from the Web System. Especially, this paper provides us very convenience check up service using the mobile phone, we can check our wanted goods or auction lists without regarding to place or time, we can alse purchase the goods more rapidly and easily.

  • PDF

An Analytical Effects of Maximum Quantity Constraint on the Nash Solution in the Uniform Price Auction (발전기 최대용량 제약이 현물시장의 내쉬균형에 미치는 영향에 대한 해석적 분석)

  • 김진호;박종배;박종근
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.6
    • /
    • pp.340-346
    • /
    • 2003
  • This paper presents a game theory application for an analysis of uniform price auction in a simplified competitive electricity market and analyzes the properties of Nash equilibrium for various conditions. We have assumed that each generation firm submits his bid to a market in the form of a sealed bid and the market is operated as a uniform price auction. Two firms are supposed to be the players of the market, and we consider the maximum generation quantity constraint of one firm only. The system demand is assumed to have a linear relationship with market clearing prices and the bidding curve of each firm, representing the price at which he has a willingness to sell his generation quantity, is also assumed to have a linear function. In this paper, we analyze the effects of maximum generation quantity constraints on the Nash equilibrium of the uniform price auction. A simple numerical example with two generation firms is demonstrated to show the basic idea of the proposed methodology.

Auction Prices Generation Agent Using Case-base Reasoning (사례 기반 추론에 의한 경매 가격 생성 에이전트)

  • Ko, Min-Jung;Lee, Yong-Kyu
    • The Journal of Society for e-Business Studies
    • /
    • v.11 no.2
    • /
    • pp.31-48
    • /
    • 2006
  • Commercial internet auction systems have been successfully used recently. In those systems, because auction 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 auction 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.

  • PDF

Volunteering system using block chain and reverse auction (블록체인을 활용한 역경매 봉사활동 관리시스템 설계)

  • Kim, Sea Woo
    • The Journal of the Convergence on Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.435-441
    • /
    • 2019
  • While block chain technique usage is wide spread over many areas, volunteering system is another subject in use. In this paper, we propose reverse auction and block chain technique in volunteering matching system. Detailed process on each step of system are suggested. Pros and cons of our new system are also discussed.

A Mobile Multimedia Auction System (모바일 멀티미디어 경매 시스템)

  • Ahn, Hoo-Young;Ryu, Ki-Young;Park, Young-Ho;Ha, Sun-Tae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.5
    • /
    • pp.320-332
    • /
    • 2007
  • Recently, new interests on digital contents and UCC(User Created Content)s are growing fast through the development of internet. However, there have been many side-effects on those interests. The representative problems are perversing illegal copies and the distributions for personal valuable digital contents to unauthorized anonymous users. These decrease creation of good digital contents by interfering with the growth of information technology industry and the content provider#s creative will. To resolve these problems, in the paper, we propose a novel auction system for multimedia contents and bidding processes. The system applies the concept of used goods onto digital contents. Especially, the auction system is based on mobile environment. Finally, the performance evaluation shows that those main auction process algorithms indicate the time complexity of logarithm scale for insertions and searches. Therefore, the performance of the system is not significantly influenced by the amount of contents even though the volume of contents in the system is increasing.

Automatic Reserve Price Generation for an Internet Auction System Using Moving Average (이동 평균을 이용한 인터넷 경매 시스템의 낙찰 예정가 자동생성)

  • 고민정;이용규
    • 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.

  • PDF

The Development of an Internet Venture and Competitive priority revenue model (닷컴 벤처의 발전과 경쟁우위 수익모델)

  • 김종권
    • 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.

  • PDF

A Forecasting Method for Court Auction Information System using Exponential Smoothing (지수평활을 이용한 법원 경매 정보 시스템의 낙찰가 예측방법)

  • Oh, Kab-Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.59-67
    • /
    • 2006
  • This paper proposes a forecasting method for court auction information system using exponential smoothing. The system forecast a highest bid price for claim analysis, and it is designed to offer an quota information by the bid price. For this realization, we implemented input interface of object data and web interface of information support. Input interface can be input, update and delete function and web interface is support some information of court auction object. We propose a forecasting method using exponential smoothing of a highest bid price for auto-claim analysis with real time information support and the results are verified the feasibility of the proposed method by experiment.

  • PDF

A Development of Court Auction Information System using Time Series Forecasting (시계열 예측을 이용한 법원경매 정보제공 시스템 개발)

  • Oh, Kab-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.172-178
    • /
    • 2006
  • This paper presents a development of court auction information system using time series forecasting. The system forecast a highest bid price for claim analysis, and it is designed to offer an quota information by the bid price. For this realization, we implemented input interface of object data and web interface of information support. Input interface can be input, update and delete function and web interface is support some information of court auction object. We propose a forecasting method of a highest bid price for auto-claim analysis with real time information support and the results are verified the feasibility of the proposed method by experiment.

Design of U-IT Technology transfer Re-Auction System Model (U-IT 기술이전 역경매 시스템 모델의 설계 개발)

  • Kim, Hye-Sun;Jeon, In-Oh;Yang, Hae-Sool
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.99-112
    • /
    • 2009
  • The research is to develop U-IT Technology Transfer Re-auction System Model for technology transfer enable transactions of buyer-oriented. The buyer sends condition technology parts and data informations to provider. The First step, The buyer sends condition technology parts and data informations to provider. The Second step, the buyer's technology and conditions in the First step will be transferred to the DB of a provider who can provide that technology. The Third step, a provider can bid after inputting the conditions. The Fourth step, the buyer decides the ranking of successful bids in condition-optimized auction process. The Fifth step, the buyer invites a provider to be a successful bidder. The last step, if there's no successful bid within the period, the sale considered failed. The buyer-oriented re-auction system is that the deal will become extinct automatically when its sale failed more than two times.