互联网拍卖的一类最优拍卖机制研究  

A Study on Optimal Mechanism of Internet Auctions

作　　者：陈龙[1] 

机构地区：[1]攀枝花学院数学与计算机学院,四川攀枝花617000

出　　处：《北京联合大学学报》2016年第2期65-71,共7页Journal of Beijing Union University

基　　金：攀枝花学院科研项目(2013YB12)

摘　　要：以Onsale网上拍卖公司为背景,在拍卖总供给给定的条件下,基于网上拍卖数量对报酬函数影响的若干重要理论,将拍卖时间视为变量,改进了拍卖时间确定的方法,得出了获取最优利润的一类新的最优拍卖机制的设计方法。Based on the auction formalism in onsale,Inc.,an Internet-based auction house. Under the condition of given supplies,based on the theory of influence of on-line auction quantity to the reward function,regards the auction time as the variable,improved the determination methods of the auction time,and obtained some new thoughts about how to obtain the optimal interest. This paper investigatesa type of optimal problems of internet auctions in the context of Onsale Internet Auction Corporation. In the setting,auction time is described as a random variable. When given the total auction supplies,by applying some important results of reward functions disturbed by the number of internet auctions,this paper improves the method of determining auction time and by finding optimal profit,obtains a new type design for auction mechanism.

关 键 词：网上拍卖 最优机制 互联网 

分 类 号：F713.359[经济管理—产业经济]