A computational model of logic-based negotiation

作者: Yan Zhang , Dongmo Zhang

DOI:

关键词: Solution conceptSequential equilibriumEquilibrium selectionMarkov perfect equilibriumMathematical optimizationSubgame perfect equilibriumInferenceNegotiationEpsilon-equilibriumBelief revisionComputer scienceTrembling hand perfect equilibriumNash equilibriumSubgame

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

参考文章(13)
Dongmo Zhang, A logical model of Nash bargaining solution international joint conference on artificial intelligence. pp. 983- 988 ,(2005)
Ariel Rubinstein, Economics and Language: Five Essays Cambridge University Press. ,(2000) , 10.1017/CBO9780511492358
Alvin E. Roth, Axiomatic models of bargaining ,(1979)
Rex Kwok, Thomas Meyer, Dongmo Zhang, Norman Foo, Logical foundations of negotiation: strategies and preferences principles of knowledge representation and reasoning. pp. 311- 318 ,(2004)
Rex Kwok, Thomas Meyer, Dongmo Zhang, Norman Foo, Negotiation as mutual belief revision national conference on artificial intelligence. pp. 317- 322 ,(2004)
Richard Booth, A negotiation-style framework for non-prioritised revision theoretical aspects of rationality and knowledge. pp. 137- 150 ,(2001)
Katia P. Sycara, Persuasive argumentation in negotiation Theory and Decision. ,vol. 28, pp. 203- 242 ,(1990) , 10.1007/BF00162699
Sarit Kraus, Katia Sycara, Amir Evenchik, Reaching agreements through argumentation: a logical model and implementation Artificial Intelligence. ,vol. 104, pp. 1- 69 ,(1998) , 10.1016/S0004-3702(98)00078-2
Simon Parsons, Carles Sierra, NR Jennings, Agents that Reason and Negotiate by Arguing Journal of Logic and Computation. ,vol. 8, pp. 261- 292 ,(1998) , 10.1093/LOGCOM/8.3.261