A computational model of logic-based negotiation
Dongmo Zhang, Yan Zhang · 2006
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 negotia-tion model. In particular, we show that the deal membership checking is DP-complete and the corresponding agreement inference problem is ΠP2-hard.