A combinatorial allocation mechanism with penalties for banner advertising
暂无分享,去创建一个
Nicole Immorlica | Vahab S. Mirrokni | Uriel Feige | Hamid Nazerzadeh | Nicole Immorlica | U. Feige | V. Mirrokni | Hamid Nazerzadeh
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Giorgio Ausiello,et al. Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..
[3] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.
[5] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[6] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[7] William J. Cook,et al. Combinatorial optimization , 1997 .
[8] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[9] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[10] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] Moses Charikar,et al. Approximating min-sum k-clustering in metric spaces , 2001, STOC '01.
[12] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[13] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[14] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[15] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[16] Aranyak Mehta,et al. AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Felix Schlenk,et al. Proof of Theorem 3 , 2005 .
[18] Vahab S. Mirrokni,et al. Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.
[19] Uriel Feige,et al. On maximizing welfare when utility functions are subadditive , 2006, STOC '06.
[20] Jason D. Hartline,et al. Knapsack auctions , 2006, SODA '06.
[21] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2006, STOC '06.
[22] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[23] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[24] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[25] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[26] Amin Saberi,et al. Allocating online advertisement space with unreliable estimates , 2007, EC '07.