Axiomatic Characterization of Task Oriented Negotiation
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 367-371.
Abstract
This paper presents an axiomatic analysis of negotiation problems within task-oriented domains (TOD). We start by applying three classical bargaining solutions of Nash, Kalai-Smorodinsky and Egalitarian to the domains of problems with a pre-process of randomization on possible agreements. We find out that these three solutions coincide within any TOD and can be characterized by the same set of axioms, which specify a solution of task oriented negotiation as an outcome of dual-process of maximizing cost reduction and minimizing workload imbalance. This axiomatic characterization is then used to produce an approximate solution to the domain of problems without randomization on possible agreements.Dongmo Zhang
@inproceedings{ijcai2009p69,
title = {Axiomatic Characterization of Task Oriented Negotiation},
author = {Zhang, Dongmo},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {367--371},
year = {2009},
url = {https://ijcai.org/proceedings/2009/69},
}
TY - CPAPER TI - Axiomatic Characterization of Task Oriented Negotiation AU - Zhang, Dongmo T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 367 EP - 371 UR - https://ijcai.org/proceedings/2009/69 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
