메뉴 건너뛰기




Volumn 4, Issue 2, 2000, Pages 80-86

Nomad: mobile agent system for an Internet-based Auction House

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; JAVA PROGRAMMING LANGUAGE; NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC; USER INTERFACES;

EID: 0033893655     PISSN: 10897801     EISSN: None     Source Type: Journal    
DOI: 10.1109/4236.832950     Document Type: Article
Times cited : (72)

References (11)
  • 2
    • 84880653860 scopus 로고    scopus 로고
    • An algorithm for optimal winner determination in combinatorial auctions
    • Morgan Kaufmann, San Francisco, Calif
    • T.W. Sandholm, "An Algorithm for Optimal Winner Determination in Combinatorial Auctions," Proc. 16th Int'l Joint Conf. Artificial Intelligence (IJCAI), Morgan Kaufmann, San Francisco, Calif., 1999, pp. 542-547.
    • (1999) Proc. 16th Int'l Joint Conf. Artificial Intelligence (IJCAI) , pp. 542-547
    • Sandholm, T.W.1
  • 3
    • 0000594032 scopus 로고
    • A combinatorial auction mechanism for airport time slot allocation
    • S.J. Rassenri, V.L. Smith, and RL. Bulfin, "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell J. of Economics, Vol. 13, 1982, pp. 402-417.
    • (1982) Bell J. of Economics , vol.13 , pp. 402-417
    • Rassenri, S.J.1    Smith, V.L.2    Bulfin, R.L.3
  • 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, No. 8, 1998, pp. 1131-1147.
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3
  • 6
    • 0041493929 scopus 로고    scopus 로고
    • Concordia: An infrastructure for collaborating mobile agents
    • Springer Lecture Notes in Computer Science 1219, Berlin, Apr
    • D. Wong et al., "Concordia: An Infrastructure for Collaborating Mobile Agents," First Int'l Workshop on Mobile Agents (MA), Springer Lecture Notes in Computer Science 1219, Berlin, Apr. 1997.
    • (1997) First Int'l Workshop on Mobile Agents (MA)
    • Wong, D.1
  • 8
    • 0031191005 scopus 로고    scopus 로고
    • Coalitions among computationally bounded agents
    • T.W. Sandholm and V.R. Lesser, "Coalitions Among Computationally Bounded Agents," Artificial Intelligence, Vol. 94, No. 1, 1997, pp. 99-137.
    • (1997) Artificial Intelligence , vol.94 , Issue.1 , pp. 99-137
    • Sandholm, T.W.1    Lesser, V.R.2
  • 9
    • 0033165014 scopus 로고    scopus 로고
    • Coalition structure generation with worst-case guarantees
    • T.W. Sandholm et al., "Coalition Structure Generation with Worst-Case Guarantees," Artificial Intelligence, Vol. 111, Nos. 1-2, 1999, pp. 209-238.
    • (1999) Artificial Intelligence , vol.111 , Issue.1-2 , pp. 209-238
    • Sandholm, T.W.1
  • 10
    • 0030359052 scopus 로고    scopus 로고
    • A Kernel-oriented model for coalition-formation in general environments: Implementation and results
    • AAAI Press, Menlo Park, Calif, Aug
    • O. Shehory and S. Kraus, "A Kernel-Oriented Model for Coalition-Formation in General Environments: Implementation and Results," Proc. Nat'l Conf. on Artificial Intelligence (AAAI), AAAI Press, Menlo Park, Calif, Aug. 1996, pp. 134-140.
    • (1996) Proc. Nat'l Conf. on Artificial Intelligence (AAAI) , pp. 134-140
    • Shehory, O.1    Kraus, S.2
  • 11
    • 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, Vol. 101, Nos. 1-2, 1998, pp. 165-200.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2


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