暂无分享,去创建一个
[1] Lawrence M. Ausubel,et al. The Lovely but Lonely Vickrey Auction , 2004 .
[2] Ilya Segal,et al. The Communication Requirements of Combinatorial Allocation Problems , 2005 .
[3] Haim Kaplan,et al. Non-price equilibria in markets of discrete goods , 2011, EC '11.
[4] N. Nisan. Chapter 9 - Algorithmic Mechanism Design: Through the lens of Multiunit auctions , 2015 .
[5] Jeremy I. Bulow,et al. Auctions versus Negotiations , 1996 .
[6] Renato Paes Leme,et al. Bounding the inefficiency of outcomes in generalized second price auctions , 2012, J. Econ. Theory.
[7] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[8] Renato Paes Leme,et al. On the efficiency of equilibria in generalized second price auctions , 2011, EC '11.
[9] Michal Feldman,et al. Simultaneous auctions are (almost) efficient , 2012, STOC '13.
[10] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[11] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[12] Noam Nisan,et al. The communication requirements of efficient allocations and supporting prices , 2006, J. Econ. Theory.
[13] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[14] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[15] Jeroen M. Swinkels. Efficiency of Large Private Value Auctions , 2001 .
[16] Zvika Neeman. The effectiveness of English auctions , 2003, Games Econ. Behav..
[17] Éva Tardos,et al. Composable and efficient mechanisms , 2012, STOC '13.
[18] Jason D. Hartline. Mechanism Design and Approximation , 2014 .
[19] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[20] Ilya Segal,et al. Optimal Pricing Mechanisms with Unknown Demand , 2002 .
[21] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[22] Shuchi Chawla,et al. Algorithmic pricing via virtual valuations , 2007, EC '07.
[23] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[24] Paul Milgrom,et al. Putting Auction Theory to Work , 2004 .
[25] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[26] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[27] Michael Ostrovsky,et al. Reserve Prices in Internet Advertising Auctions: A Field Experiment , 2009, Journal of Political Economy.
[28] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[29] Tim Roughgarden,et al. Barriers to Near-Optimal Equilibria , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[30] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[31] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[32] Anna R. Karlin,et al. Competitive auctions , 2006, Games Econ. Behav..
[33] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[34] Allan Borodin,et al. Price of anarchy for greedy auctions , 2009, SODA '10.
[35] Tim Roughgarden,et al. Revenue maximization with a single sample , 2010, EC '10.
[36] S. Bikhchandani. Auctions of Heterogeneous Objects , 1999 .
[37] E. H. Clarke. Multipart pricing of public goods , 1971 .
[38] Theodore Groves,et al. Incentives in Teams , 1973 .
[39] R. Vohra,et al. Market Research and Market Design , 2003 .