暂无分享,去创建一个
Sudipto Guha | Yishay Mansour | S. Muthukrishnan | Tanmoy Chakraborty | Eyal Even-Dar | Y. Mansour | Eyal Even-Dar | S. Guha | S. Muthukrishnan | T. Chakraborty
[1] A. W. Marshall,et al. Properties of Probability Distributions with Monotone Hazard Rate , 1963 .
[2] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[3] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[4] Carlo Vercellis,et al. Stochastic on-line knapsack problems , 1995, Math. Program..
[5] George S. Lueker,et al. Average-case analysis of off-line and on-line knapsack problems , 1995, SODA '95.
[6] Andrew S. Tanenbaum,et al. Computer networks (3rd ed.) , 1996 .
[7] Andrew S. Tanenbaum,et al. Computer Networks, 3rd Edition , 1996, Prentice-Hall international editions.
[8] Yuval Rabani,et al. Allocating bandwidth for bursty connections , 1997, STOC '97.
[9] Aranyak Mehta,et al. AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[10] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.
[11] Sudipto Guha,et al. Approximate quantiles and the order of the stream , 2006, PODS '06.
[12] Sandeep Pandey,et al. Handling Advertisements of Unknown Quality in Search Advertising , 2006, NIPS.
[13] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[14] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[15] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[16] Gagan Goel,et al. On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[17] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[18] Shuchi Chawla,et al. Sequential Posted Pricing and Multi-parameter Mechanism Design , 2010, ArXiv.
[19] Sergei Vassilvitskii,et al. Bidding for Representative Allocations for Display Advertising , 2009, WINE.
[20] Yossi Azar,et al. On Revenue Maximization in Second-Price Ad Auctions , 2009, ESA.
[21] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[22] Sergei Vassilvitskii,et al. Adaptive bidding for display advertising , 2009, WWW '09.
[23] S. Muthukrishnan,et al. Ad Exchanges: Research Issues , 2009, WINE.
[24] Hadas Shachnai,et al. Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.
[25] Jason D. Hartline,et al. Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.
[26] Gagan Goel,et al. Budget constrained auctions with heterogeneous items , 2009, STOC '10.
[27] Sergei Vassilvitskii,et al. Optimal online assignment with forecasts , 2010, EC '10.
[28] Philip J. Irving. Computer Networks 3rd Edition , 2010 .
[29] Sudipto Guha,et al. Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems , 2008, ACM Trans. Algorithms.