• 제목/요약/키워드: Internet auction

검색결과 105건 처리시간 0.025초

인터넷 경매 판매자의 판매전략이 경매 성과에 미치는 영향 : 시작가와 즉시구매옵션을 중심으로 (Sellers' Strategies in Online Auctions : Effect of Starting Bids and Buy-It-Now Options on Auction Outcomes)

  • 이호무;유지혜;안병훈
    • 한국경영과학회지
    • /
    • 제32권1호
    • /
    • pp.15-26
    • /
    • 2007
  • This study analyzes revenue-maximizing strategies of online auction sellers in terms of setting up starting bids and buy-it-now options. To this end, a series of field experiments is conducted where women's hair accessories of unique designs are listed in an established online auction site. The results of the experiments argue that high starting bids could increase sellers' revenue while buy-it-now options have no significant effects. Our findings suggest that online auction sellers listing items with uncertain demand - mainly individual sellers - should be cautious with auction tips which generally support low starting buds.

단일 서버 기반의 안전한 봉인경매 기법 (A Single Server-based Secure Electronic Sealed-Bid Auction Method)

  • 이건명;김동호
    • 한국지능시스템학회논문지
    • /
    • 제14권6호
    • /
    • pp.678-686
    • /
    • 2004
  • This paper presents a new method to securely conduct online sealed-bid auctions with a single auctioneer server The sealed-bid auctions have several vulnerable security problems when they are performed on the Internet. One of such problems is the trust establishment between an auctioneer and bidders who participate in an auction. Several online sealed-bid auction methods have been developed to address this trust problem. The proposed method solves the security problems that would happen in the sealed-bid auction using a blind signature scheme and a contract signature protocol. It prevents the auctioneer from illegally manipulating the bidders' bidding information, repudiating the reception of some bid, manipulating the auction period, and illegally adding or deleting bids. In addition, it keeps the bidders from modifying the bidding information after issuing their bid and doing intentional mistake to invalidate their own bid. The method can be easily implemented using the multiagent architecture.

인터넷 경매 입찰자를 위한 인터넷 경매 분석 에이전트 시스템 (Internet Auction Analysis Agent System for Bidder in Internet Auction)

  • 이용준;이종희;김태석;오해석
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
    • /
    • pp.340-342
    • /
    • 2000
  • 인터넷 경매는 경매인과 입찰자의 상호의사표현을 통한 구매 거래를 인터넷으로 하는 것을 말한다. 인터넷 경매는 상품을 게시하고 그 상품에 대해 경매 입찰자가 입찰에 참여하여 입찰마감시간에 가장 높은 입찰을 제시하는 경매 입찰자에게 상품이 낙찰되는 방법이 사용되고 있다. 국내에서도 인터넷 경매장이 활성화됨에 따라 인터넷 경매 사용자를 위한 소프트웨어 에이전트 시스템의 연구가 진행이 되고 있다. 그러나 현 에이전트 시스템은 경매장의 정보에 대한 검색기능만이 제공되고 있다. 일반 경매에서 경매 분석가를 통해 입찰정보와 입찰 참여에 대한 자문을 구할 수 있으나 인터넷 경매에서 이러한 경매분석가 시스템이 도입되어 있지 않다. 따라서 본 논문은 인터넷 경매에 있어서 경매인과 입찰자의 관계가 1:n인 점에 비해 제안한 시스템은 n:n 관계를 가능하게 하고 인터넷 경매에 있어서 이전의 경매결과인 사례를 통해 입찰자에게 경매 분석인 낙찰 예상가를 제시하여 보다 합리적인 가격으로 낙찰하도록 분석을 대행하는 에이전트 시스템인 Internet Auction Analyst를 제안한다.

  • PDF

Combinatorial Auction-Based Two-Stage Matching Mechanism for Mobile Data Offloading

  • Wang, Gang;Yang, Zhao;Yuan, Cangzhou;Liu, Peizhen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권6호
    • /
    • pp.2811-2830
    • /
    • 2017
  • In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

인터넷 경매에서 플로우의 형성요인과 브랜드 자산에 미치는 영향 (Flow and Brand Equity on the Internet Auction)

  • 이승창;정종원;이호근
    • 한국전자거래학회지
    • /
    • 제13권2호
    • /
    • pp.56-82
    • /
    • 2008
  • 인터넷 경매는 인터넷 비즈니스 모델 중에서 가장 성공한 비즈니스 모델이며, 고객의 참여가 가장 능동적이고 적극적이라고 할 수 있다. 인터넷 경매에서 중요한 이슈는 "고객에게 단순히 저렴한 제품을 구매하는 것 외에 어떻게 최적의 경험을 통해 즐거움을 줄 수 있는가" 하는 것이다. 즉, 고객과의 신뢰형성은 기본이고, 이를 토대로 인터넷 경매 업체들은 정보 기술을 활용하여 고객에게 최적의 경험을 제공하고, 이를 통해 브랜드 자산을 구축해야 한다. 이에 본 연구는 개인 특성(도전감, 숙련도), 정보기술 특성(정보품질, 시스템품질), 그리고 인터넷 경매 특성(가격변동성, 상호작용성) 차원에서 어떠한 요인들이 인터넷 경매 과정에서 플로우에 영향을 미치는지 탐색하고, 이러한 플로우가 브랜드 자산에 유의한 영향을 미치는지를 실증분석 하였다. 인터넷 경매 이용자 350명을 대상으로 온라인 설문 조사를 실시하였으며, 수집된 자료를 기초로 LISREL 8.50을 이용한 공변량 구조 분석을 실시하였다. 연구 결과, 인터넷 경매 사이트의 브랜드 자산 구축을 위해서는 고객에게 최적의 경험을 제공하는 것이 중요하고, 이를 위해서는 이용자 개인의 도전감, 사이트의 정보 품질과 시스템 품질, 인터넷 경매의 상호작용성을 증대시킬 수 있는 다양한 노력을 함으로써 고객에게 최적의 경험을 제공할 수 있을 것이고 이를 통해 브랜드 자산을 구축할 수 있을 것이다.

  • PDF

인터넷 경매 이용 소비자의 구매, 소비자만족, 재이용의도 및 관련 변수 (Consumers' purchase behavior and satisfaction in auction cite)

  • 허경옥
    • 한국생활과학회지
    • /
    • 제14권4호
    • /
    • pp.561-575
    • /
    • 2005
  • This paper searches Internet auction sites to study consumer willingness to reuse and consumer satisfaction, along with its frequency of usage and evaluation. This study also examines the differency in the frequency of usage, the number of products purchased, consumer satisfaction and willingness to reuse, and evaluation of the auction sites according to the characteristics of consumers' socio-economic factors and the auction site itself. Determinant variables is investigated in the level of consumer satisfaction. The results of this study are as below: First, consumers used auction sites frequently, especially when they were in their 20s, intended to purchase clothes, and thought the delivery time would be short. In addition, consumers were more likely to purchase products, with low income buy first pay later, and short deliberation. Second, consumers, unemployed and in their 50s, sell-purchase among consumers were less likely to have a willingness to reuse the auction site. However, consumers with an experience to buy clothes or products with a price between 50,000 and 100,000 won were more likely to have a willingness to reuse the site. Third, consumer satisfaction with auction sites were higher among those who were females; responsible as a consumer; full of experiences; and received the product within a short period of time. Lastly, the willingness to reuse auction sites was positively related to the following type of consumers: single, employed, and responsible as a consumer.

  • PDF

디지털 경제에서의 효율적 시장 메커니즘에 대한 연구: 가격부착 시장과 경매에 대한 가상 실험 (In Search of an Efficient Market Mechanism for a Digital Economy: Virtual Field Experiments on Posted-price Markets and Auctions)

  • Beomsoo Kim
    • 한국전자거래학회지
    • /
    • 제5권1호
    • /
    • pp.135-158
    • /
    • 2000
  • In recent years, many retail businesses jumped on the Internet auction bandwagon and paid substantially high fees to learn and develop proper business strategies for this new environment. Unlike what most businesses in the real world presume, this research shows that discriminatory-price ascending-bid auctions in a digital economy might be not very beneficial for the sellers on the Internet, if sellers sell the identical digital products through both a typical posted-price market and an auction. Using an extensive technology infrastructure along with suitable incentives and rules for market agents, we found that a discriminatory-price ascending-bid auction, which is the most popular auction mechanism on the Internet, serves consumers better than it does the sellers or producers in the digital economy. That is, the average prices for digital goods in these auctions are substantially lower than the prices in a posted-price market. This shows that it is not so wise for sellers to jump on the bandwagon of Internet auctions, if there is a market place with posted-price mechanisms which sells comparable items, or if a seller does not have special advantages or strategies in this new market institution. Electronic market mechanisms provide powerful means of understanding and measuring consumer characteristics including willingness-to-pay and other demographics for sellers or producers. Many concern that sellers may extract the entire surplus from the market by using customization on the Internet, thus consumers will be worse off in this digital economy. We found that these sellers who can customize their products and prices fail to capture the whole consumers surplus and cannot exercise a monopoly. One major explanation for this phenomenon is that the competition among the sellers prohibits them from charging prices according to customers demand for each product, where switching from one seller to another is not so difficult for the customers, and reselling products among the buyers are prohibited.

  • PDF

An Auction-Based Dispatching Method for an Electronic Brokerage of Truckload Vehicles

  • Lee, Jun Ho;Kim, Kap Hwan
    • Industrial Engineering and Management Systems
    • /
    • 제14권1호
    • /
    • pp.32-43
    • /
    • 2015
  • This study suggests an electronic brokerage system that has the capability of efficiently matching dispatching delivery tasks with trucks. In the brokerage system, individual truck drivers and shippers are allowed to participate in the dispatching process through the internet or wireless communication. An auction-based dispatching method for the electronic brokerage system is suggested. The basic rationale of the auction-based dispatching method-which is a distributed decision-making process-is discussed. The performance of the suggested algorithms is evaluated by a simulation study.

Prediction Models on Internet Auctions

  • Hong, Chong-Sun;Song, Ki-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제17권3호
    • /
    • pp.795-804
    • /
    • 2006
  • Most internet auction sites open to users the bid history with the ascending order of bid amounts. Whereas eBay.com presents second bid prices, auction.co.kr provides highest bid prices. In this paper, the bidhistory is arranged according to the passage of tim, which can help to understand the situations and trends of bid prices, especially for multiple auctions. This manipulated data can be visualized by using profile plots. The successful bid prices could be estimated based on some prediction models with appropriate prior informations. Both sellers and bidders can be provided useful informations with these statistical analyses, and then fair online auctions in Korea will grow actively and rapidly.

  • PDF

EMRQ: An Efficient Multi-keyword Range Query Scheme in Smart Grid Auction Market

  • Li, Hongwei;Yang, Yi;Wen, Mi;Luo, Hongwei;Lu, Rongxing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권11호
    • /
    • pp.3937-3954
    • /
    • 2014
  • With the increasing electricity consumption and the wide application of renewable energy sources, energy auction attracts a lot of attention due to its economic benefits. Many schemes have been proposed to support energy auction in smart grid. However, few of them can achieve range query, ranked search and personalized search. In this paper, we propose an efficient multi-keyword range query (EMRQ) scheme, which can support range query, ranked search and personalized search simultaneously. Based on the homomorphic Paillier cryptosystem, we use two super-increasing sequences to aggregate multidimensional keywords. The first one is used to aggregate one buyer's or seller's multidimensional keywords to an aggregated number. The second one is used to create a summary number by aggregating the aggregated numbers of all sellers. As a result, the comparison between the keywords of all sellers and those of one buyer can be achieved with only one calculation. Security analysis demonstrates that EMRQ can achieve confidentiality of keywords, authentication, data integrity and query privacy. Extensive experiments show that EMRQ is more efficient compared with the scheme in [3] in terms of computation and communication overhead.