Negotiation Algorithms for Large Agreement Spaces
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 3209-3209.
Abstract
We introduce a new family negotiation algorithms for complex domains with a large space of possible solutions, non-linear utility functions, limited time and many agents. This family of algorithms applies a Branch & Bound search tree to search for deals that can be proposed to other agents. We test it on two test cases: the Negotiating Salesmen Problem and the strategic board game Diplomacy.
Dave De Jonge. 2013. Negotiation Algorithms for Large Agreement Spaces. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 3209–3209. https://ijcai.org/proceedings/2013/491
De Jonge, D. (2013). Negotiation Algorithms for Large Agreement Spaces. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 (pp. 3209–3209). IJCAI. https://ijcai.org/proceedings/2013/491
@inproceedings{ijcai2013p491,
title = {Negotiation Algorithms for Large Agreement Spaces},
author = {De Jonge, Dave},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {3209--3209},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/491},
}
TY - CPAPER TI - Negotiation Algorithms for Large Agreement Spaces AU - De Jonge, Dave T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 3209 EP - 3209 UR - https://ijcai.org/proceedings/2013/491 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
