Optimal Brokerage Model using CSP Technique in Agent-Based Electronic Commerce

에이전트 기반 전자상거래에서 제약만족 기법을 이용한 최적의 중개 모델

  • 정종진 (인하대학교 대학원 전자계산공학과) ;
  • 김지연 (LG정보통신 연구소) ;
  • 조근식 (인하대학교 전자계산공학과)
  • Published : 2000.05.01

Abstract

Recently, many researchers have tried to establish EC framework EC framework for automated contract and brokerage using agent technologies in electronic commerce. Traditional researches, however, often enforced the user's participations during the automated brokerage process of agents an did not supported the procedures and methodologies for satisfying various user's requirements. In this paper, we propose a brokerge framework based on multi-agent to overcome the defects of the previous researches. For the optimal brokerage, the proposed framework is divided into tow layers, which are called competition layer and constraint satisfaction layer. The Agents process behaviors of brokerage through two layers accroding to th proposed message driven communication protocol. W also apply CSP (Constraint Satisfaction Problems) techniques to brokerage process to satisfy various preferential requirements from the user. That is, e model the relationship between buyer agents and seller agents using CSP and propose efficient CSP models for the optimal brokerage as the types of brokerage. Finally, e implemented prototype systems applying the proposed framework and showed the efficiency of he proposed framwork with the experimental results.

Keywords