메뉴 건너뛰기




Volumn 3937 LNAI, Issue , 2006, Pages 43-56

Algorithms for distributed winner determination in combinatorial auctions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING;

EID: 33845209547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888727_4     Document Type: Conference Paper
Times cited : (7)

References (19)
  • 1
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinational auctions
    • Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44 (1998) 1131-1147
    • (1998) Management Science , vol.44 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 2
    • 0036467861 scopus 로고    scopus 로고
    • An algorithm for winner determination in combinatorial auctions
    • Sandholm, T.: An algorithm for winner determination in combinatorial auctions. Artificial Intelligence 135 (2002) 1-54
    • (2002) Artificial Intelligence , vol.135 , pp. 1-54
    • Sandholm, T.1
  • 14
    • 0032074719 scopus 로고    scopus 로고
    • Methods for task allocation via agent coalition formation
    • Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101 (1998) 165-200
    • (1998) Artificial Intelligence , vol.101 , pp. 165-200
    • Shehory, O.1    Kraus, S.2
  • 15
    • 0004172726 scopus 로고    scopus 로고
    • Willer, D., ed.: Praeger Publishers, Westport CT
    • Willer, D., ed.: Network Exchange Theory. Praeger Publishers, Westport CT (1999)
    • (1999) Network Exchange Theory


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