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