Negotiation Algorithms for Large Agreement Spaces
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.
Cite
Text
de Jonge. "Negotiation Algorithms for Large Agreement Spaces." International Joint Conference on Artificial Intelligence, 2013.Markdown
[de Jonge. "Negotiation Algorithms for Large Agreement Spaces." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/dejonge2013ijcai-negotiation/)BibTeX
@inproceedings{dejonge2013ijcai-negotiation,
title = {{Negotiation Algorithms for Large Agreement Spaces}},
author = {de Jonge, Dave},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {3209-3210},
url = {https://mlanthology.org/ijcai/2013/dejonge2013ijcai-negotiation/}
}