AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation

Galit Haim; Jonathan Langer; Raz Yaniv

doi:10.1007/978-3-031-21203-1_39

AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation

Galit Haim, Jonathan Langer, Raz Yaniv

College of Management Academic Studies Israel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Designing an automated agent for Human-Agent Negotiation is a challenging task. Especially in the domain that combines multi-issue bilateral negotiations and repeated negotiations. In this domain, the agents negotiate with humans over more than one item, and there are several rounds of negotiation in each game. Designing this kind of agent can be very challenging. Our agent needs to estimate the preferences of the human opponent in real-time, proposing fair offers that will be excepted by the human opponent but taking into account, not proposing offers that don’t increase the agent’s score. On the other hand, local search algorithms have proven to be effective in a variety of fields in artificial intelligence. In this paper, we present a novel approach for an automated agent for this type of negotiation by using local search algorithms, in particular: Simulated Annealing and Hill Climbing. As we analyze the results from our experiments and compare the local search algorithms, we show that local search algorithms can be more efficient in Human-Agent negotiation than traditional methods. Moreover, our agent is capable of negotiating efficiently and outperforming the human opponent.

Original language	English
Title of host publication	PRIMA 2022
Subtitle of host publication	Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings
Editors	Reyhan Aydoğan, Natalia Criado, Victor Sanchez-Anguix, Jérôme Lang, Marc Serramia
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	612-620
Number of pages	9
ISBN (Print)	9783031212024
DOIs	https://doi.org/10.1007/978-3-031-21203-1_39
State	Published - 2023
Externally published	Yes
Event	24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020 - Valencia , Spain Duration: 16 Nov 2022 → 18 Nov 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13753 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020
Country/Territory	Spain
City	Valencia
Period	16/11/22 → 18/11/22

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

Hill climbing
Human-agent negotiation
Local search
Multi-issue bargaining
Repeated negotiations
Simulated annealing

Access to Document

10.1007/978-3-031-21203-1_39

Cite this

Haim, G., Langer, J., & Yaniv, R. (2023). AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. In R. Aydoğan, N. Criado, V. Sanchez-Anguix, J. Lang, & M. Serramia (Eds.), PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings (pp. 612-620). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13753 LNAI). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-21203-1_39

Haim, Galit ; Langer, Jonathan ; Yaniv, Raz. / AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. editor / Reyhan Aydoğan ; Natalia Criado ; Victor Sanchez-Anguix ; Jérôme Lang ; Marc Serramia. Springer Science and Business Media Deutschland GmbH, 2023. pp. 612-620 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{75c559a2382c473e9178c6912e6d4831,

title = "AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation",

abstract = "Designing an automated agent for Human-Agent Negotiation is a challenging task. Especially in the domain that combines multi-issue bilateral negotiations and repeated negotiations. In this domain, the agents negotiate with humans over more than one item, and there are several rounds of negotiation in each game. Designing this kind of agent can be very challenging. Our agent needs to estimate the preferences of the human opponent in real-time, proposing fair offers that will be excepted by the human opponent but taking into account, not proposing offers that don{\textquoteright}t increase the agent{\textquoteright}s score. On the other hand, local search algorithms have proven to be effective in a variety of fields in artificial intelligence. In this paper, we present a novel approach for an automated agent for this type of negotiation by using local search algorithms, in particular: Simulated Annealing and Hill Climbing. As we analyze the results from our experiments and compare the local search algorithms, we show that local search algorithms can be more efficient in Human-Agent negotiation than traditional methods. Moreover, our agent is capable of negotiating efficiently and outperforming the human opponent.",

keywords = "Hill climbing, Human-agent negotiation, Local search, Multi-issue bargaining, Repeated negotiations, Simulated annealing",

author = "Galit Haim and Jonathan Langer and Raz Yaniv",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020 ; Conference date: 16-11-2022 Through 18-11-2022",

year = "2023",

doi = "10.1007/978-3-031-21203-1_39",

language = "אנגלית",

isbn = "9783031212024",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "612--620",

editor = "Reyhan Aydoğan and Natalia Criado and Victor Sanchez-Anguix and J{\'e}r{\^o}me Lang and Marc Serramia",

booktitle = "PRIMA 2022",

address = "גרמניה",

}

Haim, G, Langer, J & Yaniv, R 2023, AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. in R Aydoğan, N Criado, V Sanchez-Anguix, J Lang & M Serramia (eds), PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13753 LNAI, Springer Science and Business Media Deutschland GmbH, pp. 612-620, 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, Valencia , Spain, 16/11/22. https://doi.org/10.1007/978-3-031-21203-1_39

AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. / Haim, Galit; Langer, Jonathan; Yaniv, Raz.
PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. ed. / Reyhan Aydoğan; Natalia Criado; Victor Sanchez-Anguix; Jérôme Lang; Marc Serramia. Springer Science and Business Media Deutschland GmbH, 2023. p. 612-620 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13753 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation

AU - Haim, Galit

AU - Langer, Jonathan

AU - Yaniv, Raz

PY - 2023

Y1 - 2023

N2 - Designing an automated agent for Human-Agent Negotiation is a challenging task. Especially in the domain that combines multi-issue bilateral negotiations and repeated negotiations. In this domain, the agents negotiate with humans over more than one item, and there are several rounds of negotiation in each game. Designing this kind of agent can be very challenging. Our agent needs to estimate the preferences of the human opponent in real-time, proposing fair offers that will be excepted by the human opponent but taking into account, not proposing offers that don’t increase the agent’s score. On the other hand, local search algorithms have proven to be effective in a variety of fields in artificial intelligence. In this paper, we present a novel approach for an automated agent for this type of negotiation by using local search algorithms, in particular: Simulated Annealing and Hill Climbing. As we analyze the results from our experiments and compare the local search algorithms, we show that local search algorithms can be more efficient in Human-Agent negotiation than traditional methods. Moreover, our agent is capable of negotiating efficiently and outperforming the human opponent.

AB - Designing an automated agent for Human-Agent Negotiation is a challenging task. Especially in the domain that combines multi-issue bilateral negotiations and repeated negotiations. In this domain, the agents negotiate with humans over more than one item, and there are several rounds of negotiation in each game. Designing this kind of agent can be very challenging. Our agent needs to estimate the preferences of the human opponent in real-time, proposing fair offers that will be excepted by the human opponent but taking into account, not proposing offers that don’t increase the agent’s score. On the other hand, local search algorithms have proven to be effective in a variety of fields in artificial intelligence. In this paper, we present a novel approach for an automated agent for this type of negotiation by using local search algorithms, in particular: Simulated Annealing and Hill Climbing. As we analyze the results from our experiments and compare the local search algorithms, we show that local search algorithms can be more efficient in Human-Agent negotiation than traditional methods. Moreover, our agent is capable of negotiating efficiently and outperforming the human opponent.

KW - Hill climbing

KW - Human-agent negotiation

KW - Local search

KW - Multi-issue bargaining

KW - Repeated negotiations

KW - Simulated annealing

UR - http://www.scopus.com/inward/record.url?scp=85142744731&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-21203-1_39

DO - 10.1007/978-3-031-21203-1_39

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85142744731

SN - 9783031212024

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 612

EP - 620

BT - PRIMA 2022

A2 - Aydoğan, Reyhan

A2 - Criado, Natalia

A2 - Sanchez-Anguix, Victor

A2 - Lang, Jérôme

A2 - Serramia, Marc

PB - Springer Science and Business Media Deutschland GmbH

T2 - 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020

Y2 - 16 November 2022 through 18 November 2022

ER -

Haim G, Langer J, Yaniv R. AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. In Aydoğan R, Criado N, Sanchez-Anguix V, Lang J, Serramia M, editors, PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 612-620. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-21203-1_39