Advertisement

Sample Efficient Multiagent Learning in the Presence of Markovian Agents

  • Doran┬áChakraborty

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

Table of contents

  1. Front Matter
    Pages 1-12
  2. Doran Chakraborty
    Pages 1-5
  3. Doran Chakraborty
    Pages 7-17
  4. Doran Chakraborty
    Pages 73-97
  5. Doran Chakraborty
    Pages 99-111
  6. Doran Chakraborty
    Pages 113-123
  7. Doran Chakraborty
    Pages 125-129
  8. Back Matter
    Pages 131-146

About this book

Introduction

The problem of Multiagent Learning (or MAL) is concerned with the
study of how intelligent entities can learn and adapt in the presence of
other such entities that are simultaneously adapting. The problem is
often studied in the stylized settings provided by repeated matrix games
(a.k.a. normal form games). The goal of this book is to develop MAL
algorithms for such a setting that achieve a new set of objectives which
have not been previously achieved. In particular this book deals with
learning in the presence of a new class of agent behavior that has not
been studied or modeled before in a MAL context: Markovian agent
behavior. Several new challenges arise when interacting with this
particular class of agents. The book takes a series of steps towards
building completely autonomous learning algorithms that maximize utility
while interacting with such agents. Each algorithm is meticulously
specified with a thorough formal treatment that elucidates its key
theoretical properties.

Keywords

Computational Intelligence Markovian Agents Multiagent Learning Algorithms Sample Efficient Multiagent Learning

Authors and affiliations

  • Doran┬áChakraborty
    • 1
  1. 1.Department of Computer ScienceThe University of Texas at AustinAustinUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-02606-0
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Engineering
  • Print ISBN 978-3-319-02605-3
  • Online ISBN 978-3-319-02606-0
  • Series Print ISSN 1860-949X
  • Series Online ISSN 1860-9503
  • Buy this book on publisher's site