Enabling Negotiating Agents to Explore Very Large Outcome Spaces

Conference paper (2022)

Authors

Thimjo Koca Universiteit van Amsterdam
Tim Baarslag Centrum Wiskunde & Informatica (CWI), Universiteit Utrecht
C.M. Jonker Universiteit Leiden, Interactive Intelligence - EEMCS
Research Group
Interactive Intelligence (EEMCS) (TU Delft)
Copyright: © 2022 Thimjo Koca, Tim Baarslag, C.M. Jonker
DOI
help_outline
https://doi.org/0.1007/978-3-031-20179-0_4
Search Automated negotiation Very large negotiation domain
More Info
expand_more

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Intelligent Systems

Research Group

Interactive Intelligence

Abstract

This work presents BIDS (Bidding using Diversied Search), an algorithm that can be used by negotiating agents to search very large outcome spaces. BIDS provides a balance between being rapid, accurate, diverse, and scalable search, allowing agents to search spaces with as many as 10250 possible outcomes on very run-of-the-mill hardware. We
show that our algorithm can be used to respond to the three most com-
mon search queries employed by 87% of all agents from the Automated
Negotiating Agents Competition. Furthermore, we validate one of our
techniques by integrating it into negotiation platform GeniusWeb, to en-
able existing state-of-the-art agents (and future agents) to scale their use
to very large outcome spaces.