Skip to main content

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

  • Conference paper
  • First Online:
PRIMA 2022: Principles and Practice of Multi-Agent Systems (PRIMA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13753))

  • 697 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Baarslag, T.: What to Bid and When to Stop. Ph.D. thesis (2014). https://doi.org/10.4233/uuid:3df6e234-a7c1-4dbe-9eb9-baadabc04bca

  2. Cerny, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45(4151) (1985). https://doi.org/10.1007/BF00940812

  3. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Sci. 220(4598), 671–680 (1983)

    Article  Google Scholar 

  4. Koley, G., Rao, S.: Adaptive human-agent multi-issue bilateral negotiation using the thomas-kilmann conflict mode instrument (2018). https://doi.org/10.1109/DISTRA.2018.8601002

  5. Yuan, L., Chen, S., Zhang, Z.: A novel strategy for complex human-agent negotiation. In: Sun, Y., Lu, T., Xie, X., Gao, L., Fan, H. (eds.) ChineseCSCW 2018. CCIS, vol. 917, pp. 66–76. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-3044-5_5

    Chapter  Google Scholar 

  6. Mell, J., Gratch, J.: Iago: interactive arbitration guide online (demonstration) (2016)

    Google Scholar 

  7. Mell, J., Gratch, J.: Grumpy & pinocchio: answering human-agent negotiation questions through realistic agent design (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Galit Haim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

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

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Haim, G., Langer, J., Yaniv, R. (2023). AN Using Local Search in Multi-issue Bilateral and Repeated Negotiation. In: Aydoğan, R., Criado, N., Lang, J., Sanchez-Anguix, V., Serramia, M. (eds) PRIMA 2022: Principles and Practice of Multi-Agent Systems. PRIMA 2022. Lecture Notes in Computer Science(), vol 13753. Springer, Cham. https://doi.org/10.1007/978-3-031-21203-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21203-1_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21202-4

  • Online ISBN: 978-3-031-21203-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics