A Computational Model of Logic-Based Negotiation

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 P 2 -hard.

• Type: Conference
• Year: 2006
• Where: AAAI
• Authors: Dongmo Zhang, Yan Zhang
• Keywords: AAAI 2006, Essential Computational Properties, Intelligent Agents, Nebel's Syntax-based Belief, Unique Bargaining Solution