{"type":"ScholarlyArticle","title":"Negotiation Algorithms for Large Agreement Spaces","authors":[{"name":"Dave de Jonge","slug":"dave-de-jonge","given":"Dave","family":"De Jonge","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/491","pdf":"https://ijcai.org/proceedings/2013/0491.pdf","markdown":"https://ijcai.org/proceedings/2013/491.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/491","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":491,"pages":{"first":3209,"last":3209},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}