Approximately Efficient Two-Sided Combinatorial Auctions
暂无分享,去创建一个
Tim Roughgarden | Paul W. Goldberg | Stefano Leonardi | Bart de Keijzer | Riccardo Colini-Baldeschi | Stefano Turchetta | T. Roughgarden | Paul W Goldberg | Riccardo Colini-Baldeschi | S. Leonardi | B. D. Keijzer | S. Turchetta
[1] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[2] Shahar Dobzinski,et al. Reallocation mechanisms , 2014, EC.
[3] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[4] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[5] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[6] Moshe Babaioff,et al. Mechanisms for a spatially distributed market , 2009, Games Econ. Behav..
[7] Xiaotie Deng,et al. Revenue Maximization in a Bayesian Double Auction Market , 2012, ISAAC.
[8] Yang Cai,et al. The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade , 2018, EC.
[9] Paul W. Goldberg,et al. Fixed Price Approximability of the Optimal Gain from Trade , 2017, WINE.
[10] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[11] Tim Roughgarden. Multi-Parameter Mechanism Design , 2016 .
[12] R. McAfee,et al. A dominant strategy double auction , 1992 .
[13] Bart de Keijzer,et al. Approximately Efficient Double Auctions with Strong Budget Balance , 2016, SODA.
[14] Tim Roughgarden,et al. Modularity and greed in double auctions , 2014, Games Econ. Behav..
[15] Liad Blumrosen,et al. Approximating Gains-from-Trade in Bilateral Trading , 2016, WINE.
[16] Uriel Feige,et al. Demand Queries with Preprocessing , 2014, ICALP.
[17] Tuomas Sandholm,et al. Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation , 2003, AAMAS '06.
[18] Erel Segal-Halevi,et al. SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism , 2016, SAGT.
[19] E. H. Clarke. Multipart pricing of public goods , 1971 .
[20] Yang Cai,et al. Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms , 2017, EC.
[21] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[22] Erel Segal-Halevi,et al. A Random-Sampling Double-Auction Mechanism , 2016, ArXiv.
[23] Theodore Groves,et al. Incentives in Teams , 1973 .
[24] Steven R. Williams,et al. Convergence to Efficiency in a Simple Market with Incomplete Information , 1994 .
[25] Thomas A. Gresik,et al. The rate at which a simple market converges to efficiency as the number of traders increases: An asymptotic result for optimal trading mechanisms , 1989 .
[26] Liad Blumrosen,et al. Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.
[27] Tuomas Sandholm,et al. Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation , 2003, AMEC.
[28] Steven R. Williams,et al. The Rate of Convergence to Efficiency in the Buyer's Bid Double Auction as the Market Becomes Large , 1989 .
[29] Shahar Dobzinski,et al. (Almost) Efficient Mechanisms for Bilateral Trading , 2016, ArXiv.
[30] Steven R. Williams,et al. IN A SIMPLE MARKET WITH INCOMPLETE INFORMATION , 1994 .
[31] Noam Nisan,et al. Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders , 2009 .
[32] Paul Dütting,et al. Polymatroid Prophet Inequalities , 2013, ESA.
[33] Steven R. Williams,et al. The Optimality of a Simple Market Mechanism , 2002 .
[34] Anna R. Karlin,et al. Truthful and Competitive Double Auctions , 2002, ESA.