메뉴 건너뛰기




Volumn 2125, Issue , 2001, Pages 135-147

Seller-focused algorithms for online auctioning

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ELECTRONIC COMMERCE; HEURISTIC METHODS;

EID: 35048830214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_13     Document Type: Conference Paper
Times cited : (15)

References (25)
  • 2
    • 84968329707 scopus 로고    scopus 로고
    • Blindly competitive algorithms for pricing and bidding
    • B. Awerbuch and Y. Azar. Blindly competitive algorithms for pricing and bidding. Manuscript.
    • Manuscript
    • Awerbuch, B.1    Azar, Y.2
  • 6
    • 0028254345 scopus 로고
    • A new measure for the study of on-line algorithms
    • S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11:73–91, 1994.
    • (1994) Algorithmica , vol.11 , pp. 73-91
    • Ben-David, S.1    Borodin, A.2
  • 12
    • 0016560084 scopus 로고
    • Fast approximation algorithms for the knapsack and subset sum problems
    • O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and subset sum problems. Journal of the ACM, 22:463–468, 1975.
    • (1975) Journal of the ACM , vol.22 , pp. 463-468
    • Ibarra, O.H.1    Kim, C.E.2
  • 16
    • 0012834885 scopus 로고    scopus 로고
    • Average-case analysis of off-line and on-line knapsack problems
    • November
    • G. Lueker. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms, 29(2):277–305, November 1998.
    • (1998) Journal of Algorithms , vol.29 , Issue.2 , pp. 277-305
    • Lueker, G.1
  • 19
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinatorial auctions
    • M. H. Rothkopf, A Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131–1147, 1998.
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 20
    • 0016437461 scopus 로고
    • Approximation algorithms for the 0/1 knapsack problem
    • S. Sahni. Approximation algorithms for the 0/1 knapsack problem. Journal of the ACM, 22:115–124, 1975.
    • (1975) Journal of the ACM , vol.22 , pp. 115-124
    • Sahni, S.1
  • 25
    • 0032398304 scopus 로고    scopus 로고
    • Competitive analysis of on-line disk scheduling
    • T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Theory of Computing Systems, 31:491–506, 1998.
    • (1998) Theory of Computing Systems , vol.31 , pp. 491-506
    • Yeh, T.1    Kuo, C.2    Lei, C.3    Yen, H.4


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