메뉴 건너뛰기




Volumn 3, Issue 1, 2000, Pages 73-96

Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation

Author keywords

Anytime algorithm; Coalition formation; Contracting; Electronic commerce; Game theory; Multiagent systems; Negotiation; Resource bounded reasoning

Indexed keywords


EID: 0034418764     PISSN: 13872532     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010038012192     Document Type: Article
Times cited : (89)

References (47)
  • 4
    • 0028447220 scopus 로고
    • Deliberation scheduling for problem solving in time-constrained environments
    • M. Boddy and T. Dean, "Deliberation scheduling for problem solving in time-constrained environments," Artificial Intelligence, vol. 67, pp. 245-285, 1994.
    • (1994) Artificial Intelligence , vol.67 , pp. 245-285
    • Boddy, M.1    Dean, T.2
  • 6
    • 0002281917 scopus 로고    scopus 로고
    • The WALRAS algorithm: "A convergent distributed implementation of general equilibrium outcomes,"
    • J. Q. Cheng and M. P. Wellman, The WALRAS algorithm: "A convergent distributed implementation of general equilibrium outcomes," Computational Economics, vol. 12, pp. 1-24, 1998.
    • (1998) Computational Economics , vol.12 , pp. 1-24
    • Cheng, J.Q.1    Wellman, M.P.2
  • 7
    • 0040830326 scopus 로고
    • Cooperative distributed problem solving
    • A. Barr, P. Cohen, and E. Feigenbaum (Eds.), Addison Wesley
    • E. Durfee, V. Lesser, and D. Corkill, "Cooperative distributed problem solving," in The Handbook of Artificial Intelligence, A. Barr, P. Cohen, and E. Feigenbaum (Eds.), Addison Wesley 1989, vol. IV, pp. 83-147.
    • (1989) The Handbook of Artificial Intelligence , vol.4 , pp. 83-147
    • Durfee, E.1    Lesser, V.2    Corkill, D.3
  • 9
    • 84948984615 scopus 로고    scopus 로고
    • Analyzing the social behavior of contract net protocol
    • Agents Breaking Away; MAAMAW'96, W. Van de Velde and J. W. Perram, (Eds.), Springer-Verlag
    • C. Gu and T. Ishida, "Analyzing the social behavior of contract net protocol," in Agents Breaking Away; MAAMAW'96, Lecture Notes in Artificial Intelligence 1038, W. Van de Velde and J. W. Perram, (Eds.), Springer-Verlag, 1996, pp. 116-127.
    • (1996) Lecture Notes in Artificial Intelligence , vol.1038 , pp. 116-127
    • Gu, C.1    Ishida, T.2
  • 13
    • 0029328146 scopus 로고
    • Multiagent negotiation under time constraints
    • S. Kraus, J. Wilkenfeld, and G. Zlotkin, "Multiagent negotiation under time constraints," Artificial Intelligence, vol. 75, pp. 297-345, 1995.
    • (1995) Artificial Intelligence , vol.75 , pp. 297-345
    • Kraus, S.1    Wilkenfeld, J.2    Zlotkin, G.3
  • 20
    • 0008086640 scopus 로고
    • A strategy for decreasing the total transportation costs among area-distributed transportation centers
    • Turku School of Economics: Finland
    • T. W. Sandholm, "A strategy for decreasing the total transportation costs among area-distributed transportation centers," in Nordic Operations Analysis in Cooperation (NOAS): OR in Business, Turku School of Economics: Finland, 1991.
    • (1991) Nordic Operations Analysis in Cooperation (NOAS): OR in Business
    • Sandholm, T.W.1
  • 22
    • 0027708201 scopus 로고
    • An implementation of the contract net protocol based on marginal cost calculations
    • Washington, D.C., July
    • T. W. Sandholm, "An implementation of the contract net protocol based on marginal cost calculations," in Proceedings of the National Conference on Artificial Intelligence (AAAI), Washington, D.C., July 1993, pp. 256-262.
    • (1993) Proceedings of the National Conference on Artificial Intelligence (AAAI) , pp. 256-262
    • Sandholm, T.W.1
  • 25
    • 0002431467 scopus 로고    scopus 로고
    • Contract types for satisficing task allocation: I theoretical results
    • Stanford University, CA, March
    • T. W. Sandholm, "Contract types for satisficing task allocation: I theoretical results," in AAAI Spring Symposium Series: Satisficing Models, Stanford University, CA, March 1998, pp. 68-75.
    • (1998) AAAI Spring Symposium Series: Satisficing Models , pp. 68-75
    • Sandholm, T.W.1
  • 26
    • 84880653860 scopus 로고    scopus 로고
    • An algorithm for optimal winner determination in combinatorial auctions
    • Stockholm, Sweden, Extended version: Washington University, Department of Computer Science technical report WUCS-99-01, January
    • T. W. Sandholm, "An algorithm for optimal winner determination in combinatorial auctions," in Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999, pp. 542-547. Extended version: Washington University, Department of Computer Science technical report WUCS-99-01, January.
    • (1999) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI) , pp. 542-547
    • Sandholm, T.W.1
  • 27
    • 0033165014 scopus 로고    scopus 로고
    • Coalition structure generation with worst case guarantees
    • to appear
    • T. W. Sandholm, K. S. Larson, M. R. Andersson, O. Shehory, and F. Tohmé, "Coalition structure generation with worst case guarantees," Artificial Intelligence, 1999, to appear. Early version appeared at the National Conference on Artificial Intelligence (AAAI), 1998, pp. 46-53.
    • (1999) Artificial Intelligence
    • Sandholm, T.W.1    Larson, K.S.2    Andersson, M.R.3    Shehory, O.4    Tohmé, F.5
  • 28
    • 0031640262 scopus 로고    scopus 로고
    • T. W. Sandholm, K. S. Larson, M. R. Andersson, O. Shehory, and F. Tohmé, "Coalition structure generation with worst case guarantees," Artificial Intelligence, 1999, to appear. Early version appeared at the National Conference on Artificial Intelligence (AAAI), 1998, pp. 46-53.
    • (1998) National Conference on Artificial Intelligence (AAAI) , pp. 46-53
  • 30
    • 0003101953 scopus 로고
    • Issues in automated negotiation and electronic commerce: Extending the contract net framework
    • San Francisco, CA, June
    • T. W. Sandholm and V. R. Lesser, "Issues in automated negotiation and electronic commerce: Extending the contract net framework," in Proceedings of the First International Conference on MultiAgent Systems (ICMAS), San Francisco, CA, June 1995, pp. 328-335. Reprinted in Readings in Agents, Huhns and Singh (Eds.), 1997, pp. 66-73.
    • (1995) Proceedings of the First International Conference on MultiAgent Systems (ICMAS) , pp. 328-335
    • Sandholm, T.W.1    Lesser, V.R.2
  • 31
    • 0004123209 scopus 로고    scopus 로고
    • Reprinted in Huhns and Singh (Eds.)
    • T. W. Sandholm and V. R. Lesser, "Issues in automated negotiation and electronic commerce: Extending the contract net framework," in Proceedings of the First International Conference on MultiAgent Systems (ICMAS), San Francisco, CA, June 1995, pp. 328-335. Reprinted in Readings in Agents, Huhns and Singh (Eds.), 1997, pp. 66-73.
    • (1997) Readings in Agents , pp. 66-73
  • 33
    • 0031191005 scopus 로고    scopus 로고
    • Coalitions among computationally bounded agents
    • T. W. Sandholm and V. R. Lesser, "Coalitions among computationally bounded agents," Artificial Intelligence, 94(1), pp. 99-137, 1997. Special issue on Economic Principles of Multiagent Systems. Early version appeared at the International Joint Conference on Artificial Intelligence, pp. 662-669, 1995.
    • (1997) Artificial Intelligence , vol.94 , Issue.1 , pp. 99-137
    • Sandholm, T.W.1    Lesser, V.R.2
  • 34
    • 0031191005 scopus 로고    scopus 로고
    • T. W. Sandholm and V. R. Lesser, "Coalitions among computationally bounded agents," Artificial Intelligence, 94(1), pp. 99-137, 1997. Special issue on Economic Principles of Multiagent Systems. Early version appeared at the International Joint Conference on Artificial Intelligence, pp. 662-669, 1995.
    • (1995) International Joint Conference on Artificial Intelligence , pp. 662-669
  • 35
    • 84880672871 scopus 로고    scopus 로고
    • Algorithms for optimizing leveled commitment contracts
    • Stockholm, Sweden, Extended version: Washington University, Department of Computer Science technical report WUCS-99-02
    • T. W. Sandholm, S. Sikka, and S. Norden, "Algorithms for optimizing leveled commitment contracts," in Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999, pp. 535-540. Extended version: Washington University, Department of Computer Science technical report WUCS-99-02.
    • (1999) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI) , pp. 535-540
    • Sandholm, T.W.1    Sikka, S.2    Norden, S.3
  • 40
    • 0030359052 scopus 로고    scopus 로고
    • A kernel-oriented model for coalition-formation in general environments: Implemetation and results
    • Portland, OR, August
    • O. Shehory and S. Kraus, "A kernel-oriented model for coalition-formation in general environments: Implemetation and results," in Proceedings of the National Conference on Artificial Intelligence (AAAI), Portland, OR, August 1996, pp. 134-140.
    • (1996) Proceedings of the National Conference on Artificial Intelligence (AAAI) , pp. 134-140
    • Shehory, O.1    Kraus, S.2
  • 41
    • 0019180974 scopus 로고
    • The contract net protocol: High-level communication and control in a distributed problem solver
    • December
    • R. G. Smith, "The contract net protocol: High-level communication and control in a distributed problem solver," IEEE Transactions on Computers, vol. C-29(12), pp. 1104-1113, December 1980.
    • (1980) IEEE Transactions on Computers , vol.C-29 , Issue.12 , pp. 1104-1113
    • Smith, R.G.1
  • 42
    • 0000011467 scopus 로고
    • Multiagent compromise via negotiation
    • M. Huhns and L. Gasser (Eds.), Pittman Publishing Ltd and Morgan Kaufmann
    • K. Sycara, "Multiagent compromise via negotiation," in Distributed Artificial Intelligence, Volume II, M. Huhns and L. Gasser (Eds.), Pittman Publishing Ltd and Morgan Kaufmann, 1989.
    • (1989) Distributed Artificial Intelligence , vol.2
    • Sycara, K.1
  • 43
    • 0033320016 scopus 로고    scopus 로고
    • Coalition formation processes with belief revision among bounded rational, self-interested agents
    • F. Tohmé and T. W. Sandholm, "Coalition formation processes with belief revision among bounded rational, self-interested agents," Journal of Logic and Computation, vol. 9(97-63), pp. 1-23, 1999. An early version appeared in the IJCAI-97 Workshop on Social Interaction and Communityware, Nagoya, Japan, pp. 43-51.
    • (1999) Journal of Logic and Computation , vol.9 , Issue.63-97 , pp. 1-23
    • Tohmé, F.1    Sandholm, T.W.2
  • 44
    • 0033320016 scopus 로고    scopus 로고
    • Nagoya, Japan
    • F. Tohmé and T. W. Sandholm, "Coalition formation processes with belief revision among bounded rational, self-interested agents," Journal of Logic and Computation, vol. 9(97-63), pp. 1-23, 1999. An early version appeared in the IJCAI-97 Workshop on Social Interaction and Communityware, Nagoya, Japan, pp. 43-51.
    • IJCAI-97 Workshop on Social Interaction and Communityware , pp. 43-51
  • 45
    • 0001989407 scopus 로고
    • A market-oriented programming environment and its application to distributed multicommodity flow problems
    • M. Wellman, "A market-oriented programming environment and its application to distributed multicommodity flow problems, Journal of Artificial Intelligence Research, vol. 1, pp. 1-23, 1993.
    • (1993) Journal of Artificial Intelligence Research , vol.1 , pp. 1-23
    • Wellman, M.1
  • 46
    • 0030122886 scopus 로고    scopus 로고
    • Optimal composition of real-time systems
    • S. Zilberstein and S. Russell, "Optimal composition of real-time systems," Artificial Intelligence, vol. 82(1-2), pp. 181-213, 1996.
    • (1996) Artificial Intelligence , vol.82 , Issue.1-2 , pp. 181-213
    • Zilberstein, S.1    Russell, S.2


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