메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 564-571

Generating coalition structures with finite bound from the optimal guarantees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ELECTRONIC COMMERCE; OPTIMAL SYSTEMS;

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

References (11)
  • 1
    • 1142268202 scopus 로고    scopus 로고
    • Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/suppy function bidding
    • V. D. Dang and N. R. Jennings. Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/suppy function bidding. In Proceedings of the Fifth International Conference on Electronic Commerce, pages 25-30, 2003.
    • (2003) Proceedings of the Fifth International Conference on Electronic Commerce , pp. 25-30
    • Dang, V.D.1    Jennings, N.R.2
  • 4
    • 0036565545 scopus 로고    scopus 로고
    • Dynamic coalition formation among rational agents
    • M. Klusch and A. Gerber. Dynamic coalition formation among rational agents. IEEE Intelligent Systems, 17(3):42-47, 2002.
    • (2002) IEEE Intelligent Systems , vol.17 , Issue.3 , pp. 42-47
    • Klusch, M.1    Gerber, A.2
  • 10
    • 0032074719 scopus 로고    scopus 로고
    • Methods for task allocation via agent coalition formation
    • O. Shehory and S. Kraus. Methods for task allocation via agent coalition formation. Artificial Intelligence Journal, 101(1-2) :165-200, 1998.
    • (1998) Artificial Intelligence Journal , vol.101 , Issue.1-2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2


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