Auctions with online supply
作者： Moshe Babaioff , Liad Blumrosen , Aaron Roth
DOI: 10.1016/J.GEB.2015.01.004
关键词:
摘要: Abstract Online advertising auctions present settings in which there is uncertainty about the number of items for sale. We study mechanisms selling identical when total supply unknown but drawn from a known distribution. Items arrive dynamically, and seller must make immediate allocation payment decisions with goal maximizing social welfare. devise simple incentive-compatible mechanism that guarantees some constant fraction first-best solution. A surprising feature our it artificially limits supply, we show limiting essential obtaining high Although common revenue, commitment to limit less intuitive The performance guarantee expectation over distribution; similar every realization impossible.
sci-hub.se 参考文章(27)
Paul R. Milgrom, Robert J. Weber, A theory of auctions and competitive bidding Econometrica. ,vol. 50, pp. 1089- 1122 ,(1982) , 10.2307/1911865
Roger B. Myerson, INCENTIVE COMPATIBILITY AND THE BARGAINING PROBLEM Econometrica. ,vol. 47, pp. 61- 73 ,(1979) , 10.2307/1912346
Richard Cole, Shahar Dobzinski, Lisa Fleischer, Prompt Mechanisms for Online Auctions algorithmic game theory. pp. 170- 181 ,(2008) , 10.1007/978-3-540-79309-0_16
Olivier Compte, Ron Lavi, Ella Segev, Efficiency of sequential english auctions with dynamic arrivals electronic commerce. pp. 369- 369 ,(2012) , 10.1145/2229012.2229041
R.Preston McAfee, Daniel Vincent, The Declining Price Anomaly Journal of Economic Theory. ,vol. 60, pp. 191- 212 ,(1993) , 10.1006/JETH.1993.1041
Jason D Hartline, Approximation in Mechanism Design The American Economic Review. ,vol. 102, pp. 330- 336 ,(2012) , 10.1257/AER.102.3.330
Ron Lavi, Noam Nisan, Competitive analysis of incentive compatible on-line auctions Theoretical Computer Science. ,vol. 310, pp. 159- 180 ,(2004) , 10.1016/S0304-3975(03)00391-8
Noam Nisan, Ron Lavi, Online ascending auctions for gradually expiring items symposium on discrete algorithms. pp. 1146- 1155 ,(2005) , 10.5555/1070432.1070596
Andrew Chi-Chin Yao, Probabilistic computations: Toward a unified measure of complexity 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). pp. 222- 227 ,(1977) , 10.1109/SFCS.1977.24
Roger B. Myerson, Optimal Auction Design Mathematics of Operations Research. ,vol. 6, pp. 58- 73 ,(1981) , 10.1287/MOOR.6.1.58