Logistic regression in sealed-bid auctions with multiple rounds: Application in Korean court auction

نویسندگان

  • Cookhwan Kim
  • Woojin Chang
چکیده

This paper proposes a forecasting method for court auction information system using logistic regression model with heterogeneity across the multiple round. The goal is to predict whether an individual auction item in a certain round will be sold or not. A simple linear regression and the least angle regression (LARS) containing random effect terms were used to select meaningful variables for our logit model. The link function of the proposed logit model is represented by two bundles of parameters. The former part consists of the parameters whose values do not change over rounds. The latter part has parameters whose values interact with rounds. The observed data corresponding to an appraiser price as well as an intercept term reflecting local characteristics are used without any change. Data that corresponds to all the other parameters is not directly used, but transformed based on similarities between the original item and the surrounding auction items being recommended by the court auction experts. We tested the Bayesian logistic regression by establishing different priors: Dunson’s prior, Gelman’s prior and Ansari’s prior. Dunson’s prior was found to perform the best. Little significant difference was found between the results of the other two priors. These findings indicate that logistic regression taking the heterogeneity of multiround into account performs better than a one-layered neural network over all time periods. 2010 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding Up Ascending-Bid Auctions

In recent years auctions have grown in interest within the AI community as innovative mechanisms for resource allocation. The primary contribution of this paper is to identify a family of hybrid auctions, called survival auctions, which combine the benefits of both sealed-bid auctions (namely, quick and predictable termination time) and ascendingbid auctions (namely, more information revelation...

متن کامل

Private Auctions with Multiple Rounds and Multiple Items

For selling spectrum licenses economists have designed new auction types proceeding over several rounds and offering several licenses simultaneously. Communication between bidders usually is forbidden to prevent collusions (i.e., through separate compartments and supervision). We investigate these auctions from the cryptographic point of view and identify that the usual implementation by a succ...

متن کامل

Accounting for Cognitive Costs in On - lineAuction

Many auction mechanisms, including rst and second price ascending and sealed bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of diierent mechanisms for on-line auctions, focusing on the cognitive costs placed on users (e.g. the cost of determining the value of a good), the possibilities for agent mediation, and the trust properties of the auc...

متن کامل

Cost and Trust Issues in On-Line Auctions

Many auction mechanisms, including rst and second-price ascending and sealed-bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of di erent mechanisms for on-line auctions, focusing on the di erent costs of determining reservation prices, determining bids and communicating bids, and on whether the auctioneer is trusted. Di erent auction formats ...

متن کامل

Sealed-Bid Micro Auctions

In electronic auction applications, small-value merchandise is often distributed. We call this kind of auction micro auction. Compared to traditional general-purpose electronic auction, micro electronic auction has its own special requirements. Especially, micro auction must be very efficient: the cost of the auction protocol must not be over the cost of the merchandise for sale. Although the m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2011