메뉴 건너뛰기




Volumn , Issue , 2003, Pages 371-377

Agent-based decision support for actual-world procurement scenarios

Author keywords

[No Author keywords available]

Indexed keywords

AGENT-BASED DECISION SUPPORT; AGENT-BASED SERVICES; COMBINATORIAL AUCTION; COMPLEX NEGOTIATION; MULTI-ITEM; MULTI-UNIT; MULTIPLE ITEMS; SIDE CONSTRAINTS; STRATEGIC ISSUES; WINNER DETERMINATION;

EID: 78649700939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (14)
  • 1
    • 78649687519 scopus 로고    scopus 로고
    • Agentcities project. http://www.agentcities.org.
  • 2
    • 0012353659 scopus 로고    scopus 로고
    • An integer programming formulation of the bid evaluation problem for coordinated tasks
    • R. V. Dietrich, B.and Vohra, editor, Mathematics of the Internet: E-Auction and Markets
    • J. Collins and M. Gini. An integer programming formulation of the bid evaluation problem for coordinated tasks. In R. V. Dietrich, B.and Vohra, editor, Mathematics of the Internet: E-Auction and Markets, volume 127 of IMA Volumes in Mathematics and its Applications, pages 59-74.
    • IMA Volumes in Mathematics and Its Applications , vol.127 , pp. 59-74
    • Collins, J.1    Gini, M.2
  • 3
    • 78649697654 scopus 로고    scopus 로고
    • The blue jade project
    • D. Cowan. The blue jade project. http://sourceforge.net/projects/ bluejade.
    • Cowan, D.1
  • 4
    • 78649689577 scopus 로고    scopus 로고
    • Fipa. http://www.fipa.org.
  • 5
    • 84949430733 scopus 로고    scopus 로고
    • Combinatorial auctions, knapsack problems, and hill-climbing search
    • Springer-Verlag, Heidelberg
    • R. C. Holte. Combinatorial auctions, knapsack problems, and hill-climbing search. In Lecture Notes in Computer Science, volume 2056. Springer-Verlag, Heidelberg.
    • Lecture Notes in Computer Science , vol.2056
    • Holte, R.C.1
  • 7
    • 78649691731 scopus 로고    scopus 로고
    • Protege 2000. http://protege.stanford.edu.
    • (2000)
  • 9
    • 0032141895 scopus 로고
    • Computationally manageable combinatorial auctions
    • M. H. Rothkopt, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 8(44):1131-11147, 1995.
    • (1995) Management Science , vol.8 , Issue.44 , pp. 1131-11147
    • Rothkopt, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 12
    • 0036467861 scopus 로고    scopus 로고
    • Algorithm for optimal winner determination in combinatorial auctions
    • T. W. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, 2002.
    • (2002) Artificial Intelligence , vol.135 , pp. 1-54
    • Sandholm, T.W.1


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