Axiomatic characterization of task oriented negotiation

作者: Dongmo Zhang

DOI:

关键词:

摘要: This paper presents an axiomatic analysis of negotiation problems within task-oriented domains (TOD). We start by applying three classical bargaining solutions Nash, Kalai-Smorodinsky and Egalitarian to the with a preprocess randomization on possible agreements. find out that these coincide any TOD can be characterized same set axioms, which specify solution task oriented as outcome dual-process maximizing cost reduction minimizing workload imbalance. characterization is then used produce approximate domain without

参考文章(20)
Jeffrey S. Rosenschein, Gilad Zlotkin, A domain theory for task oriented negotiation international joint conference on artificial intelligence. pp. 416- 422 ,(1993)
Jeffrey S. Rosenschein, Gilad Zlotkin, Rules of encounter: designing conventions for automated negotiation among computers MIT Press. ,(1994)
Ariel Rubinstein, Economics and Language: Five Essays Cambridge University Press. ,(2000) , 10.1017/CBO9780511492358
Somdeb Lahiri, Axiomatic characterization of the Nash and Kalai-Smorodinsky solutions for discrete bargaining problems Pure mathematics and applications. ,vol. 14, pp. 207- 220 ,(2003)
Ken Binmore, Martin J. Osborne, Ariel Rubinstein, Noncooperative models of bargaining Research Papers in Economics. ,vol. 1, pp. 179- 225 ,(1989)
P. E. Dunne, Extremal behaviour in multiagent contract negotiation Journal of Artificial Intelligence Research. ,vol. 23, pp. 41- 78 ,(2005) , 10.1613/JAIR.1526
Jens Leth Hougaard, Mich Tvede, Nonconvex n-person bargaining: efficient maxmin solutions Economic Theory. ,vol. 21, pp. 81- 95 ,(2003) , 10.1007/S00199-001-0246-7
Lin Zhou, THE NASH BARGAINING THEORY WITH NON-CONVEX PROBLEMS Econometrica. ,vol. 65, pp. 681- 685 ,(1997) , 10.2307/2171759
Marco Mariotti, Nash bargaining theory when the number of alternatives can be finite Social Choice and Welfare. ,vol. 15, pp. 413- 421 ,(1998) , 10.1007/S003550050114