Hats, auctions and derandomization

We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal deterministic auction for bi-valued auctions. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 478-493, 2015

[1]  Alastair Macaulay,et al.  You can leave your hat on , 2005 .

[2]  Anna R. Karlin,et al.  Competitive auctions , 2006, Games Econ. Behav..

[3]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

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

[6]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[7]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[8]  Todd Ebert,et al.  Applications of recursive operators to randomness and complexity , 1998 .

[9]  Oren Ben-Zwi,et al.  A Hat Trick , 2010, FUN.

[10]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

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

[12]  Ilan Newman,et al.  Optimal Bi-Valued Auctions , 2011, ArXiv.

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

[14]  Oren Ben-Zwi.  Algorithmic Game Theory and Graphs , 2011 .

[15]  Aranyak Mehta,et al.  Randomized truthful auctions of digital goods are randomizations over truthful auctions , 2004, EC '04.

[16]  Amos Fiat,et al.  Competitive generalized auctions , 2002, STOC '02.

[17]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

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

[20]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[21]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[22]  Anna R. Karlin,et al.  A Lower Bound on the Competitive Ratio of Truthful Auctions , 2004, STACS.

[23]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[24]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[25]  Moshe Tennenholtz,et al.  Approximately optimal mechanism design via differential privacy , 2010, ITCS '12.

[26]  Noga Alon,et al.  Problems and results in extremal combinatorics - II , 2008, Discret. Math..

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

[28]  J. Mirrlees.  An Exploration in the Theory of Optimum Income Taxation an Exploration in the Theory of Optimum Income Taxation L Y 2 , 2022 .

[29]  Ilan Newman,et al.  A New Derandomization of Auctions , 2009, SAGT.

[30]  Amos Fiat,et al.  Derandomization of auctions , 2005, STOC '05.

[31]  Robin A. Moser.  A constructive proof of the Lovász local lemma , 2008, STOC '09.

[32]  Ilya Segal,et al.  Optimal Pricing Mechanisms with Unknown Demand , 2002 .

[33]  David Wolfe,et al.  Puzzlers' tribute : a feast for the mind , 2001 .

[34]  Peter Winkler,et al.  Games People Don � t Play , 2022 .

[35]  Mohammad Taghi Hajiaghayi,et al.  Hat Guessing Games , 2008, SIAM Rev..

[36]  Uriel Feige,et al.  On the Competitive Ratio of the Random Sampling Auction , 2005, WINE.