Competitive auctions

被引:152
作者
Goldberg, AV
Hartline, JD
Karlin, AR
Saks, M
Wright, A
机构
[1] Univ Washington, Dept Comp Sci, Seattle, WA 98195 USA
[2] Rutgers State Univ, Hill Ctr, Dept Math, Piscataway, NJ 08854 USA
基金
美国国家科学基金会;
关键词
D O I
10.1016/j.geb.2006.02.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
We study a class of single-round, sealed-bid auctions for an item in unlimited supply, such as a digital good. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e. encourages bidders to bid their true valuations) and on all inputs yields profit that is within a constant factor of the profit of the optimal single sale price. We justify the use of optimal single price profit as a benchmark for evaluating a competitive auctions profit. We exhibit several randomized competitive auctions and show that there is no symmetric deterministic competitive auction. Our results extend to bounded supply markets, for which we also give competitive auctions. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:242 / 269
页数:28
相关论文
共 32 条
  • [1] Abrams Zoe, 2006, P 17 ANN ACM SIAM S, P1074
  • [2] Aggarwal G., 2005, PROC 37 ANN ACM S TH, P619
  • [3] [Anonymous], CRELLES J REINE ANGE
  • [4] [Anonymous], P 17 ANN ACM SIAM S
  • [5] ARCHER A, 2002, P 13 ACM S DISCR ALG
  • [6] BALCAN MF, 2005, P 46 IEEE S FDN COMP
  • [7] BALIGA S, 2003, ADV THEORET EC, P3
  • [8] Bar-Yossef Ziv, 2002, P 13 ANN ACM SIAM S, P623
  • [9] BLUM A, 2003, P 14 ANN ACM SIAM S
  • [10] Blum A, 2005, PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1156