Online bidding system based on Cournot model using K-means clustering

Abstract

Online E-commence has been growing rapidly in the world. Online bidding has become popular. This work will come out with a model of online bidding system (OBS). This paper propose a new model to deal with online bidding, we deal with auction with Cournot Bidding Data Mining (CBDM). CBDM framework based on Cournot model is designed for K-means clustering. The input auction space is partitioned into groups of similar auctions by K-means clustering algorithm. The problem of finding the value of k in K-means algorithm is solved by method using Cournot competition. Cournot bidding is employed to obtain the optimal bidding strategies for the current auction. The clustering algorithm has been deployed successfully into online bidding, yielding significant improvement in performance over the existing OBS.