Skip to main content

BraveCat: Iterative Deepening Distance-Based Opponent Modeling and Hybrid Bidding in Nonlinear Ultra Large Bilateral Multi Issue Negotiation Domains

  • Chapter
  • First Online:

Part of the book series: Studies in Computational Intelligence ((SCI,volume 638))

Abstract

In this study, we propose BraveCat agent, one of the ANAC 2014 finalists. The main challenge of ANAC 2014 was dealing with nonlinear utility scenarios and ultra large-size domains. Since the conventional frequency and Bayesian opponent models cannot be used to model the unknown complex nonlinear utility space or preference profile of the opponent in ultra large domains, we design a new distance based opponent model to estimate the utility of a candidate bid to be sent to the opponent in each round of the negotiation. Moreover, by using iterative deepening search, BraveCat overcomes the limitations imposed by the huge amount of memory needed in the ultra large domains. It also uses a hybrid bidding strategy that combines behaviors of time dependent, random, and imitative strategies.

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

Buying options

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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    In normal distribution, when the random variable value resides in the interval [−2.58, 2.58], the accumulative probability will equal to 99 %. That is, in a normal distribution experiment with 99 % probability, the random variable value will fall into the interval [−2.58, 2.58].

References

  1. Baarslag, T., Hindriks, K., Hendrikx, M., Dirkzwager, A., Jonker, C.: Decoupling negotiating agents to explore the space of negotiation strategies. In: Novel Insights in Agent-based Complex Automated Negotiation, pp. 61–83. Springer (2014)

    Google Scholar 

  2. Baarslag, T., Hindriks, K., Jonker, C., Kraus, S., Lin, R.: The first automated negotiating agents competition (anac 2010). In: New Trends in Agent-based Complex Automated Negotiations, pp. 113–135. Springer (2012)

    Google Scholar 

  3. Baarslag, T., Hindriks, K., Jonker, C.: A tit for tat negotiation strategy for real-time bilateral negotiations. In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds.) Complex Automated Negotiations: Theories. Models, and Software Competitions, volume 435 of Studies in Computational Intelligence, pp. 229–233. Springer, Heidelberg (2013)

    Google Scholar 

  4. Faratin, P., Sierra, C., Jennings, N.R.: Negotiation decision functions for autonomous agents. Robot. Auton. Syst. 24(3), 159–182 (1998)

    Google Scholar 

  5. Hindriks, K., Tykhonov, D.: Opponent modelling in automated multi-issue negotiation using bayesian learning. In: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pp. 331–338. International Foundation for Autonomous Agents and Multiagent Systems, Estoril, Portugal (2008)

    Google Scholar 

  6. Katsuhide, F., Ito, T., Baarslag, T., Hindriks, K., Jonker, C., Kraus, S., Lin, R.: The second automated negotiating agents competition (anac2011). In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds.) Complex Automated Negotiations: Theories. Models, and Software Competitions, volume 435 of Studies in Computational Intelligence, pp. 183–197. Springer, Heidelberg (2013)

    Google Scholar 

  7. Kawaguchi, S., Fujita, K., Ito, T.: Agentk: compromising strategy based on estimated maximum utility for automated negotiating agents. In: Ito, Takayuki, Zhang, Minjie, Robu, Valentin, Fatima, Shaheen, Matsuo, Tokuro (eds.) New Trends in Agent-Based Complex Automated Negotiations. Studies in Computational Intelligence, vol. 383, pp. 137–144. Springer, Heidelberg (2012)

    Google Scholar 

  8. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach (2010)

    Google Scholar 

  9. van Krimpen, T., Looije, D., Hajizadeh, S.: Hardheaded. In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds.) Complex Automated Negotiations: Theories. Models, and Software Competitions, volume 435 of Studies in Computational Intelligence, pp. 223–227. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Faria Nassiri-Mofakham .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Zafari, F., Nassiri-Mofakham, F. (2016). BraveCat: Iterative Deepening Distance-Based Opponent Modeling and Hybrid Bidding in Nonlinear Ultra Large Bilateral Multi Issue Negotiation Domains. In: Fukuta, N., Ito, T., Zhang, M., Fujita, K., Robu, V. (eds) Recent Advances in Agent-based Complex Automated Negotiation. Studies in Computational Intelligence, vol 638. Springer, Cham. https://doi.org/10.1007/978-3-319-30307-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30307-9_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30305-5

  • Online ISBN: 978-3-319-30307-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics