论文信息 - A Computational Model of Logic-Based Negotiation

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

Yan Zhang | Dongmo Zhang

[1] Norman Y. Foo,et al. Logical Foundations of Negotiation: Strategies and Preferences , 2004, KR.

[2] Peter Gärdenfors,et al. Knowledge in Flux: Modeling the Dynamics of Epistemic States , 2008 .

[3] A. McLennan. Economics and language: Five essays. , 2002 .

[4] P G rdenfors,et al. Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[5] A. Roth. Axiomatic models of bargaining , 1979 .

[6] A. Muthoo. Bargaining Theory with Applications , 1999 .

[7] Norman Y. Foo,et al. Negotiation as Mutual Belief Revision , 2004, AAAI.

[8] R. Booth. A negotiation-style framework for non-prioritised revision , 2001 .

[9] Katia Sycara,et al. Persuasive argumentation in negotiation , 1990 .

[10] Nicholas R. Jennings,et al. Agents That Reason and Negotiate by Arguing , 1998, J. Log. Comput..

[11] Sarit Kraus,et al. Reaching Agreements Through Argumentation: A Logical Model and Implementation , 1998, Artif. Intell..

[12] Dongmo Zhang,et al. A Logical Model of Nash Bargaining Solution , 2005, IJCAI.

[13] A. Rubinstein,et al. Bargaining and Markets. , 1991 .

[14] Bernhard Nebel,et al. Belief Revision: Syntax based approaches to belief revision , 1992 .