Axiomatic characterization of task oriented negotiation

Dongmo Zhang

Axiomatic characterization of task oriented negotiation

Dongmo Zhang

School of Computer, Data & Mathematical Sciences

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

10 Citations (Scopus)

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 preprocess 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 dualprocess 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.

Original language	English
Title of host publication	IJCAI-09: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11-17 July 2009
Publisher	AAAI Press
Pages	367-372
Number of pages	6
ISBN (Print)	9781577354260
Publication status	Published - 2009
Event	International Joint Conference on Artificial Intelligence - Duration: 3 Aug 2013 → …

Conference

Conference	International Joint Conference on Artificial Intelligence
Period	3/08/13 → …

Keywords

artificial intelligence
negotiation

Cite this

@inproceedings{0df83cc4e7fa464e85cc190886405130,

title = "Axiomatic characterization of task oriented negotiation",

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 preprocess 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 dualprocess 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.",

keywords = "artificial intelligence, negotiation",

author = "Dongmo Zhang",

year = "2009",

language = "English",

isbn = "9781577354260",

pages = "367--372",

booktitle = "IJCAI-09: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11-17 July 2009",

publisher = "AAAI Press",

note = "International Joint Conference on Artificial Intelligence ; Conference date: 03-08-2013",

}

TY - GEN

T1 - Axiomatic characterization of task oriented negotiation

AU - Zhang, Dongmo

PY - 2009

Y1 - 2009

N2 - 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 preprocess 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 dualprocess 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.

AB - 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 preprocess 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 dualprocess 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.

KW - artificial intelligence

KW - negotiation

UR - http://handle.uws.edu.au:8081/1959.7/504580

M3 - Conference Paper

SN - 9781577354260

SP - 367

EP - 372

BT - IJCAI-09: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11-17 July 2009

PB - AAAI Press

T2 - International Joint Conference on Artificial Intelligence

Y2 - 3 August 2013

ER -

Axiomatic characterization of task oriented negotiation

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this