[1] 陈李钢,祁巍,李一军.基于赞助搜索的广告研究进展评述[J].管理评论,2011,23(10):66-76. [2] 欧海鹰,吕廷杰.在线关键词广告研究综述:新的研究方向[J].管理评论,2011,23(4):54-63. [3] Varian H. Position auctions[J]. International Journal of Industrial Organization, 2007, 25(6): 1163-1178. [4] Edelman B, Ostrovsky M, Schwarz M. Internet advertising and the generalized second price auction: selling billions of dollars worth of keywords[J]. The American Economic Review, 2007, 97(1): 242-259. [5] Bu TM, Deng X, Qi Q. Forward looking nash equilibrium for keyword auction[J]. Information Processing Letters, 2008, 105(2): 41-46. [6] Bu TM, Liang L, Qi Q. On robustness of forward-looking in sponsored search auction [J]. Algorithmica, 2010, 58(4): 970-989. [7] Cary M, Das A, Edelman B, et al. Greedy bidding strategies for keyword auctions[A]. MacKie-Mason JK, Parkes DC, Resnick, P. Proceedings of the 8th ACM conference on Electronic commerce[C]. New York: ACM Press, 2007. 262-271. [8] Vorobeychik Y, Reeves D M. Equilibrium analysis of dynamic bidding in sponsored search auctions[J]. International Journal of Electronic Business, 2008, 6(2): 172-193. [9] Edelman B, Schwarz M. Optimal auction design and equilibrium selection in sponsored search auctions[J]. The American Economic Review, 2010, 100(2): 597-602. [10] 戎文晋,刘树林.关键词拍卖中最优保留价的研究[J].管理科学学报,2010,13(4):29-37. [11] 曹文彬,浦徐进,李磊.不完全信息下基于GSP的竞价排名问题研究[J].中国管理科学,2012,19(5):109-114. [12] Dobzinski S, Lavi R, Nisan N. Multi-unit auctions with budget limits[J]. Games and Economic Behavior, 2012, 74(2): 486-503. [13] Leme R P, Tardos E. Pure and bayes-nash price of anarchy for generalized second price auction[A]. Guerrero J. Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science[C]. Los Alamitos: IEEE Computer Society, 2010. 1-17. [14] Orda A, Rom R, Shimkin N. Competitive routing in multi-user communication networks[J]. IEEE/ACM Transaction on Networking, 1993, 1(5): 510-521. |