메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 834-841

Forming efficient agent groups for completing complex tasks

Author keywords

Complex task allocation; Efficient allocation

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING;

EID: 34247269173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160784     Document Type: Conference Paper
Times cited : (34)

References (16)
  • 1
    • 0024054633 scopus 로고
    • The probabilistic analysis of a heuristic for the assignment problem
    • D. Avis and C. Lai. The probabilistic analysis of a heuristic for the assignment problem. SIAM J. Comput., 17(4):732-741, 1988.
    • (1988) SIAM J. Comput , vol.17 , Issue.4 , pp. 732-741
    • Avis, D.1    Lai, C.2
  • 3
    • 4544249875 scopus 로고    scopus 로고
    • Generating coalition structures with finite bound from the optimal guarantees
    • V. Dang and N. Jennings. Generating coalition structures with finite bound from the optimal guarantees. In AAMAS'04, pages 564-571, 2004.
    • (2004) AAMAS'04 , pp. 564-571
    • Dang, V.1    Jennings, N.2
  • 5
    • 0032599448 scopus 로고    scopus 로고
    • Feasible formation of coalitions among autonomous agents in non-super additive environments
    • S. Kraus and O. Shehory. Feasible formation of coalitions among autonomous agents in non-super additive environments. Computational Intelligence, 15(3):218-251, 1999.
    • (1999) Computational Intelligence , vol.15 , Issue.3 , pp. 218-251
    • Kraus, S.1    Shehory, O.2
  • 6
    • 1142305162 scopus 로고    scopus 로고
    • Coalition formation with uncertain heterogeneous information
    • S. Kraus, O. Shehory, and G. Taase. Coalition formation with uncertain heterogeneous information. In AAMAS03, pages 1-8, 2003.
    • (2003) AAMAS03 , pp. 1-8
    • Kraus, S.1    Shehory, O.2    Taase, G.3
  • 7
    • 4544279717 scopus 로고    scopus 로고
    • The advantages of compromising in coalition formation with incomplete information
    • S. Kraus, O. Shehory, and G. Taase. The advantages of compromising in coalition formation with incomplete information. In AAMAS04, pages 588-595, 2004.
    • (2004) AAMAS04 , pp. 588-595
    • Kraus, S.1    Shehory, O.2    Taase, G.3
  • 8
    • 0344235434 scopus 로고    scopus 로고
    • Task allocation via multi-agent coalition formation: Taxonomy, algorithms and complexity
    • H. Lau and L. Zhang. Task allocation via multi-agent coalition formation: taxonomy, algorithms and complexity. In ICTAI'03, pages 346-350, 2003.
    • (2003) ICTAI'03 , pp. 346-350
    • Lau, H.1    Zhang, L.2
  • 9
    • 0035538082 scopus 로고    scopus 로고
    • Strategyproof sharing of submodular costs: Budget balance versus efficiency
    • H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory, 18(3):511-533, 2001.
    • (2001) Economic Theory , vol.18 , Issue.3 , pp. 511-533
    • Moulin, H.1    Shenker, S.2
  • 10
    • 33846669324 scopus 로고
    • Efficient mechanisms for bilateral trading
    • R. B. Myerson and M. A. Satterthwaite. Efficient mechanisms for bilateral trading. Economic Theory, 29(3):265-281, 1983.
    • (1983) Economic Theory , vol.29 , Issue.3 , pp. 265-281
    • Myerson, R.B.1    Satterthwaite, M.A.2
  • 12
    • 0242622485 scopus 로고    scopus 로고
    • Combinatorial auction design
    • A. Pekec and M. H. Rothkopf. Combinatorial auction design. Management Science, 49(11):1485-1503, 2003.
    • (2003) Management Science , vol.49 , Issue.11 , pp. 1485-1503
    • Pekec, A.1    Rothkopf, M.H.2
  • 13
    • 0034225659 scopus 로고    scopus 로고
    • Constrained multi-object auctions and b-matching
    • July
    • M. Penn and M. Tennenholtz. Constrained multi-object auctions and b-matching. Information Processing Letters, 75(1-2):29-34, July 2000.
    • (2000) Information Processing Letters , vol.75 , Issue.1-2 , pp. 29-34
    • Penn, M.1    Tennenholtz, M.2
  • 14
    • 0036467861 scopus 로고    scopus 로고
    • An algorithm for optimal winner determination in combinatorial auctions
    • T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, 2002.
    • (2002) Artificial Intelligence , vol.135 , pp. 1-54
    • Sandholm, T.1
  • 15
    • 84962128756 scopus 로고    scopus 로고
    • Searching for optimal coalition structures
    • S. Sen and P. S. Dutta. Searching for optimal coalition structures. In ICMAS00, pages 287-292, 2000.
    • (2000) ICMAS00 , pp. 287-292
    • Sen, S.1    Dutta, P.S.2
  • 16
    • 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, 101(1-2):165-200, 1998.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2


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