On revenue maximization with sharp multi-unit demands
暂无分享,去创建一个
[1] Vladlen Koltun,et al. Near-Optimal Pricing in Near-Linear Time , 2005, WADS.
[2] B. Calder,et al. New media interactive advertising vs. traditional advertising , 1998 .
[3] Xiaotie Deng,et al. Pricing ad slots with consecutive multi-unit demand , 2016, Autonomous Agents and Multi-Agent Systems.
[4] Amos Fiat,et al. Revenue maximizing envy-free multi-unit auctions with budgets , 2012, EC '12.
[5] L. Shapley,et al. The assignment game I: The core , 1971 .
[6] R. Engelbrecht-Wiggans,et al. Multi-unit auctions with uniform prices , 1998 .
[7] Sergei Vassilvitskii,et al. Optimal envy-free pricing with metric substitutability , 2008, EC '08.
[8] Noam Nisan,et al. Google's auction for TV ads , 2009, SODA '10.
[9] Shi Ying,et al. Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.
[10] Piotr Krysta,et al. Single-minded unlimited supply pricing on sparse instances , 2006, SODA '06.
[11] Patrick Briest,et al. Uniform Budgets and the Envy-Free Pricing Problem , 2008, ICALP.
[12] Vittorio Bilò,et al. Approximating the revenue maximization problem with sharp demands , 2013, Theor. Comput. Sci..
[13] Lawrence M. Ausubel,et al. Demand Reduction and Inefficiency in Multi-Unit Auctions , 2014 .
[14] Jason D. Hartline,et al. Envy, truth, and profit , 2011, EC '11.
[15] Ning Chen,et al. Envy-free pricing in multi-item markets , 2014, TALG.
[16] Ginger Rosenkrans,et al. The Creativeness and Effectiveness of Online Interactive Rich Media Advertising , 2009 .
[17] Fan Chung Graham,et al. Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.
[18] Amos Fiat,et al. Envy, Multi Envy, and Revenue Maximization , 2009, WINE.
[19] Venkatesan Guruswami,et al. On profit-maximizing envy-free pricing , 2005, SODA '05.
[20] D. Gale,et al. Multi-Item Auctions , 1986, Journal of Political Economy.
[21] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[22] Arpita Ghosh,et al. Computing Optimal Bundles for Sponsored Search , 2007, WINE.
[23] Xiaotie Deng,et al. Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets , 2010, FAW.
[24] Fabrizio Grandoni,et al. Pricing on paths: a PTAS for the highway problem , 2011, SODA '11.
[25] John William Hatfield,et al. Strategy-proof, efficient, and nonbossy quota allocations , 2009, Soc. Choice Welf..
[26] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[27] Maria-Florina Balcan,et al. Approximation algorithms and online mechanisms for item pricing , 2006, EC '06.
[28] Carmine Ventre,et al. Combinatorial auctions with verification are tractable , 2010, Theor. Comput. Sci..
[29] Chaitanya Swamy,et al. Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[30] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[31] Martin Pesendorfer,et al. Combination Bidding in Multi-Unit Auctions , 2006 .
[32] Khaled M. Elbassioni,et al. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems , 2009, SAGT.
[33] Martin Shubik,et al. The Assignment Game , 1971 .
[34] Sergey Bereg,et al. Frontiers in Algorithmics , 2016, Lecture Notes in Computer Science.