Buying cheap is expensive: hardness of non-parametric multi-product pricing
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[2] Alexander Grigoriev,et al. Pricing Network Edges to Cross a River , 2004, WAOA.
[3] Vladlen Koltun,et al. Near-Optimal Pricing in Near-Linear Time , 2005, WADS.
[4] Rajeev Motwani,et al. Algorithms for Multi-product Pricing , 2004, ICALP.
[5] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[6] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[7] Drew Fudenberg,et al. Game theory (3. pr.) , 1991 .
[8] Shahar Dobzinski,et al. An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.
[9] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[10] Erik D. Demaine,et al. Combination can be hard: approximability of the unique coverage problem , 2006, SODA '06.
[12] Andrew V. Goldberg,et al. Competitive auctions and digital goods , 2001, SODA '01.
[13] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[14] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[15] Venkatesan Guruswami,et al. On profit-maximizing envy-free pricing , 2005, SODA '05.
[16] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[17] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2006, STOC '06.
[18] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[19] Piotr Krysta,et al. Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing , 2005, MFCS.
[20] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[21] Benjamin Van Roy,et al. A Non-Parametric Approach to Multi-Product Pricing , 2003 .
[22] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[23] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[24] William J. Cook,et al. Combinatorial optimization , 1997 .
[25] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..
[26] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[27] A. Blum. ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .
[28] Amos Fiat,et al. Competitive generalized auctions , 2002, STOC '02.
[29] Maria-Florina Balcan,et al. Approximation Algorithms and Online Mechanisms for Item Pricing , 2007, Theory Comput..
[30] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[31] Alexander Grigoriev,et al. Pricing bridges to cross a river , 2007 .
[32] Piotr Krysta,et al. Single-minded unlimited supply pricing on sparse instances , 2006, SODA '06.
[33] 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).
[34] Noga Alon,et al. Derandomized graph products , 1995, computational complexity.
[35] R. Steele. Optimization , 2005 .
[36] P. Gács,et al. Algorithms , 1992 .
[37] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[38] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[39] Peter W. Glynn,et al. A Nonparametric Approach to Multiproduct Pricing , 2006, Oper. Res..
[40] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[41] Amos Fiat,et al. Derandomization of auctions , 2005, STOC '05.