Skip to main content

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

Abstract

In the previous chapter, we presented an algorithm LoE-AIM that models memory-bounded agents assuming that the memory size of these agents is known beforehand. In situations where such prior knowledge is unavailable, a possible solution can be to use a very large memory size that suffices to be a conservative upper-bound of the true unknown memory size.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Doran Chakraborty .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chakraborty, D. (2014). Convergence, Targeted Optimality and Safety in Multiagent Learning. In: Sample Efficient Multiagent Learning in the Presence of Markovian Agents. Studies in Computational Intelligence, vol 523. Springer, Cham. https://doi.org/10.1007/978-3-319-02606-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02606-0_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02605-3

  • Online ISBN: 978-3-319-02606-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics