Simple Auctions with Simple Strategies
暂无分享,去创建一个
Nikhil R. Devanur | S. Matthew Weinberg | Vasilis Syrgkanis | Jamie Morgenstern | S. Weinberg | Jamie H. Morgenstern | Vasilis Syrgkanis | Jamie Morgenstern
[1] O. Ashenfelter,et al. Testing for Price Anomalies in Real Estate Auctions , 1992 .
[2] Ian L. Gale,et al. Bottom-Fishing and Declining Prices in Sequential Auctions , 1994 .
[3] Dean P. Foster,et al. Calibrated Learning and Correlated Equilibrium , 1997 .
[4] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[5] Paul R. Milgrom,et al. A Theory of Auctions and Competitive Bidding II , 2000 .
[6] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[7] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[8] J. Goeree,et al. Bidders' Choice Auctions: Raising Revenues Through the Right to Choose , 2003 .
[9] Chaitanya Swamy,et al. Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[10] Noam Nisan,et al. Approximation algorithms for combinatorial auctions with complement-free bidders , 2005, STOC '05.
[11] Shahar Dobzinski,et al. Two Randomized Mechanisms for Combinatorial Auctions , 2007, APPROX-RANDOM.
[12] Yishay Mansour,et al. From External to Internal Regret , 2005, J. Mach. Learn. Res..
[13] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[14] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[15] Timothy C. Salmon,et al. Continuous ascending vs. pooled multiple unit auctions , 2007, Games Econ. Behav..
[16] Theo Offerman,et al. Creating competition out of thin air: An experimental study of right-to-choose auctions , 2008, Games Econ. Behav..
[17] Maria-Florina Balcan,et al. Item pricing for revenue maximization , 2008, EC '08.
[18] Renato Paes Leme,et al. Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[19] Allan Borodin,et al. Price of anarchy for greedy auctions , 2009, SODA '10.
[20] Ronald M. Harstad. Auctioning the Right to Choose When Competition Persists , 2010, Decis. Anal..
[21] Renato Paes Leme,et al. GSP auctions with correlated types , 2011, EC '11.
[22] Tim Roughgarden,et al. Welfare guarantees for combinatorial auctions with item bidding , 2011, SODA '11.
[23] Haim Kaplan,et al. Non-price equilibria in markets of discrete goods , 2011, EC '11.
[24] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[25] Tim Roughgarden,et al. From convex optimization to randomized mechanisms: toward optimal combinatorial auctions , 2011, STOC '11.
[26] Renato Paes Leme,et al. On the efficiency of equilibria in generalized second price auctions , 2011, EC '11.
[27] U. Feige,et al. Maximizing Non-monotone Submodular Functions , 2011 .
[28] Tim Roughgarden,et al. The price of anarchy in games of incomplete information , 2012, SECO.
[29] Éva Tardos,et al. Bayesian sequential auctions , 2012, EC '12.
[30] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2012, J. Comput. Syst. Sci..
[31] T. Roughgarden. Intrinsic robustness of the price of anarchy , 2012, Commun. ACM.
[32] Vasilis Syrgkanis,et al. Bayesian Games and the Smoothness Framework , 2012, ArXiv.
[33] Tim Roughgarden,et al. Combinatorial auctions with restricted complements , 2012, EC '12.
[34] Renato Paes Leme,et al. Sequential auctions and externalities , 2011, SODA.
[35] Berthold Vöcking,et al. Online Mechanism Design (Randomized Rounding on the Fly) , 2012, ICALP.
[36] Michal Feldman,et al. Limits of Efficiency in Sequential Auctions , 2013, WINE.
[37] Éva Tardos,et al. Composable and efficient mechanisms , 2012, STOC '13.
[38] Michal Feldman,et al. Simultaneous auctions are (almost) efficient , 2012, STOC '13.
[39] Tim Roughgarden,et al. Barriers to Near-Optimal Equilibria , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[40] Yang Cai,et al. Simultaneous bayesian auctions and computational complexity , 2014, EC.
[41] L. Babai,et al. Theory of Computing , 2015 .
[42] Shahar Dobzinski,et al. On the Complexity of Computing an Equilibrium in Combinatorial Auctions , 2014, SODA.
[43] Annamária Kovács,et al. Bayesian Combinatorial Auctions , 2008, ICALP.