메뉴 건너뛰기




Volumn , Issue , 2001, Pages 175-180

Combinatorial Trading Mechanism for Task Allocation1

Author keywords

bidding; combinatorial auction; multi agent; task allocation

Indexed keywords

COMMERCE; ITERATIVE METHODS;

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

References (9)
  • 4
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinatorial auctions
    • M. H. Rothkopf, A. Pekec, and R. M. Harstad, "Computationally manageable combinatorial auctions, " Management Science, vol. 44, pp. 1131-1147, 1998.
    • (1998) Management Science , vol.44 , pp. 1131-1147
    • Rothkopf, M. H.1    Pekec, A.2    Harstad, R. M.3
  • 6
    • 0002431467 scopus 로고    scopus 로고
    • Contract types for satisfying task allocation: I Theoretical results
    • T. W. Sandholm, "Contract types for satisfying task allocation: I Theoretical results, " In AAAI 1998 Spring Symposium: Satisfying Models, pp. 23-25, 1998.
    • (1998) AAAI 1998 Spring Symposium: Satisfying Models , pp. 23-25
    • Sandholm, T. W.1
  • 8
    • 0019180974 scopus 로고
    • The contract net protocol: High-level communication and control in a distributed problem solver
    • R. G. Smith, "The contract net protocol: High-level communication and control in a distributed problem solver, " IEEE Transaction on Computer, vol. C-29, pp. 1104-1113, 1980.
    • (1980) IEEE Transaction on Computer , vol.C-29 , pp. 1104-1113
    • Smith, R. G.1


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