A Computational Model of Logic-Based Negotiation

نویسندگان

  • Dongmo Zhang
  • Yan Zhang
چکیده

This paper presents a computational model of negotiation based on Nebel’s syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining game without using lotteries. Its game-theoretic properties are discussed against the existence and uniqueness of Nash equilibrium and subgame perfect equilibrium. We also study essential computational properties in relation to our negotiation model. In particular, we show that the deal membership checking is DP-complete and the corresponding agreement inference problem is Π2 -hard.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the use of logic in negotiation

This paper considers the use of logic-based languages for multiagent negotiation. We begin by motivating the use of such languages, and introducing a formal model of logic-based negotiation. Using this model, we define two important computational problems: the success problem (given a particular negotiation history, has agreement been reached?) and the guaranteed success problem (does a particu...

متن کامل

Logic for Negotiation

This paper considers the use of logic-based languages for multiagent negotiation. We begin by motivating the use of such languages, and introducing a formal model of logic-based negotiation. Using this model, we define two important computational problems: the success problem (given a particular negotiation history, has agreement been reached?) and the guaranteed success problem (does a particu...

متن کامل

Languages for Negotiation

This paper considers the use of logic-based languages for multi-agent negotiation. We begin by motivating the use of such languages, and introducing a formal model of logic-based negotiation. Using this model, we define two important computational problems: the success problem (given a particular negotiation history, has agreement been reached?) and the guaranteed success problem (does a partic...

متن کامل

Fuzzy Motion Control for Wheeled Mobile Robots in Real-Time

Due to various advantages of Wheeled Mobile Robots (WMRs), many researchers have focused to solve their challenges. The automatic motion control of such robots is an attractive problem and is one of the issues which should carefully be examined. In the current paper, the trajectory tracking problem of WMRs which are actuated by two independent electrical motors is deliberated. To this end, and ...

متن کامل

Cross-Cultural Time Sensitivity in a Bilateral E-Negotiation System

For a long time, culture has been an influencing parameter in negotiations. Growth of international trades and business competitions has increased the importance of negotiations among countries and different cultures. Developing new technologies, particularly the use of artificial intelligence in electronic trading areas, has provided us with the application of intelligent agents to resolve cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006