메뉴 건너뛰기




Volumn , Issue , 2009, Pages 71-78

The adwords problem: Online keyword matching with budgeted bidders under random permutations

Author keywords

Adwords; Learning; Matching; Online; Random permutation

Indexed keywords

COMPETITIVE RATIO; KEY WORD MATCHING; PAC LEARNING; RANDOM PERMUTATIONS; SEARCH KEYWORD; TRAINING PHASE;

EID: 76749148680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1566374.1566384     Document Type: Conference Paper
Times cited : (364)

References (20)
  • 3
    • 33748593645 scopus 로고    scopus 로고
    • Mechanism design via machine learning
    • Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, and Yishay Mansour. Mechanism design via machine learning. In FOCS, pages 605-614, 2005.
    • (2005) FOCS , pp. 605-614
    • Balcan, M.-F.1    Blum, A.2    Hartline, J.D.3    Mansour, Y.4
  • 5
    • 38049055894 scopus 로고    scopus 로고
    • Online primal-dual algorithms for maximizing ad-auctions revenue
    • Niv Buchbinder, Kamal Jain, and Joseph Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA, pages 253-264, 2007.
    • (2007) ESA , pp. 253-264
    • Buchbinder, N.1    Jain, K.2    Naor, J.3
  • 6
    • 0041133246 scopus 로고
    • The optimum choice of the instant for stopping a markov process
    • E. B. Dynkin. The optimum choice of the instant for stopping a markov process. Sov. Math. Dokl., 4, 1963.
    • (1963) Sov. Math. Dokl. , vol.4
    • Dynkin, E.B.1
  • 7
    • 33846065942 scopus 로고    scopus 로고
    • Strategic bidder behavior in sponsored search auctions
    • Benjamin Edelman and Michael Ostrovsky. Strategic bidder behavior in sponsored search auctions. Decis. Support Syst., 43(1):192-198, 2007.
    • (2007) Decis. Support Syst. , vol.43 , Issue.1 , pp. 192-198
    • Edelman, B.1    Ostrovsky, M.2
  • 8
    • 35448949581 scopus 로고    scopus 로고
    • Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords
    • March
    • Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242-259, March 2007.
    • (2007) American Economic Review , vol.97 , Issue.1 , pp. 242-259
    • Edelman, B.1    Ostrovsky, M.2    Schwarz, M.3
  • 11
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 12
    • 0347998609 scopus 로고    scopus 로고
    • Pruhs. An optimal deterministic algorithm for online b-matching
    • Bala Kalyanasundaram and Kirk R. Pruhs. An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci., 233(1-2):319-325, 2000.
    • (2000) Theor. Comput. Sci. , vol.233 , Issue.1-2 , pp. 319-325
    • Kalyanasundaram, B.1    Kirk, R.2
  • 14
    • 20744435602 scopus 로고    scopus 로고
    • A multiple-choice secretary algorithm with applications to online auctions
    • Philadelphia, PA, USA, Society for Industrial and Applied Mathematics
    • Robert Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 630-631, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
    • (2005) SODA '05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 630-631
    • Kleinberg, R.1
  • 19
    • 35348964197 scopus 로고    scopus 로고
    • Adwords and generalized online matching
    • Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. J. ACM, 54(5):22, 2007.
    • (2007) J. ACM , vol.54 , Issue.5 , pp. 22
    • Mehta, A.1    Saberi, A.2    Vazirani, U.3    Vazirani, V.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.