Exploring the Properties of Efficiency of Asymmetric 3-bidder English Auctions through Decision Tree Algorithm

• Main Authors: Ho, Ching-Hua, 何青樺
• Other Authors: Liang, Gau-Rong
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/89341407390423369586

碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === Many sufficient conditions of asymmetric efficient English auction have been developed from the given valuation functions. For example, pairwise single-crossing condition, average crossing condition, cyclical crossing condition are typical ones. Also how to find more sufficient conditions is the research goal. In this thesis, a decision tree algorithm is proposed to explore additional sufficient conditions. Moreover, a computer-based exploring system consisting of an auction data generator, a relational database, an efficient auction testing system, and a decision tree algorithm has been built. The auction data generator is used for generating random data for constructing valuation functions. The relational database is used for storing the generated data for statistic use lately. The auction testing system is used for identifying whether the auction data is efficient or not. Given the well-tested data of efficient auctions, the decision tree algorithm is used to learn the rules as their possible pre-conditions. The learning result is to show a possible research direction for exploring more sufficient conditions of efficient auction.