Prior-free auction mechanism for online supplier with risk taking

Abstract Auction is a useful trade manner for digital goods procurements in e-market places. In this paper, we present a novel prior-free auction mechanism for supplier that serves online buyers. As the recommended the auction mechanism, the supplier has incomplete knowledge of the distribution of buyers’ valuations and makes a decision to accept or to reject each bid before each buyer leaves. To analyze auction performance without making assumptions about the prior input distribution, the competitive analysis of online algorithmic mechanism is motivated. We extend the original model to present a competitive risk analysis framework by introducing risk and forecast. Moreover, a λ -tolerance algorithmic mechanism and an n-phase λ -tolerance algorithmic mechanism are proposed. They enable a supplier to utilize and exploit forecast under different risk tolerances. Solutions of these risk algorithms yield many insights as follows: a supplier’s risk management performance, i.e., the restricted competitive ratio can be improved by putting reasonable forecasts comparing with the traditional competitive analysis; a supplier can also control his risk behavior even if the forecast is incorrect; this risk framework provides a smooth generalization for a supplier’s riskless choices and risky choices. .

[1]  Tim Roughgarden,et al.  Optimal mechanism design and money burning , 2008, STOC.

[2]  George D. Stamoulis,et al.  An auction mechanism for allocating the bandwidth of networks to their users , 2007, Comput. Networks.

[3]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[4]  Andrew V. Goldberg,et al.  Competitive auctions and digital goods , 2001, SODA '01.

[5]  Ning Chen,et al.  Optimal competitive auctions , 2014, STOC.

[6]  Lei Wang,et al.  An on-line auction method for resource allocation in computational grids , 2013 .

[7]  Xinmin Liu,et al.  Competitive risk management for online Bahncard problem , 2009 .

[8]  Nikhil R. Devanur,et al.  Envy freedom and prior-free mechanism design , 2012, J. Econ. Theory.

[9]  M. Rothschild,et al.  Increasing risk: I. A definition , 1970 .

[10]  Tiaojun Xiao,et al.  Risk sharing and information revelation mechanism of a one-manufacturer and one-retailer supply chain facing an integrated competitor , 2009, Eur. J. Oper. Res..

[11]  Elias Koutsoupias,et al.  On the Competitive Ratio of Online Sampling Auctions , 2010, WINE.

[12]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2004, Theor. Comput. Sci..

[13]  Jason D. Hartline,et al.  Envy, truth, and profit , 2011, EC '11.

[14]  Joan Boyar,et al.  A comparison of performance measures via online search , 2011, Theor. Comput. Sci..

[15]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[16]  George D. Stamoulis,et al.  An auction mechanism for bandwidth allocation over paths , 2001 .

[17]  Andrew B. Whinston,et al.  Managing Risks in Multiple Online Auctions: An Options Approach , 2005, Decis. Sci..

[18]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[19]  Aravind Srinivasan,et al.  On random sampling auctions for digital goods , 2009, EC '09.

[20]  Jason D. Hartline,et al.  From optimal limited to unlimited supply auctions , 2005, EC '05.

[21]  Nikhil R. Devanur,et al.  Limited and online supply and the bayesian foundations of prior-free mechanism design , 2009, EC '09.

[22]  Michael L. Honig,et al.  Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing , 2008, IEEE Journal on Selected Areas in Communications.

[23]  S. Matthew Weinberg,et al.  Optimal and Efficient Parametric Auctions , 2013, SODA.