IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-5975-6_7.html
   My bibliography  Save this book chapter

Two Person Decentralized Team Problem With Incomplete Information

In: Learning Algorithms Theory and Applications

Author

Listed:
  • S. Lakshmivarahan

    (University of Oklahoma, School of Electrical Engineering and Computer Science)

Abstract

In this chapter we propose a learning approach to the two person decentralized team problem with incomplete information: Let A and B be the two persons each with two actions at their disposal. At any instant each person picks an action (perhaps randomly) and let i be the action chosen by A and j by B. As a result of their joint actions, both A and B receive the same outcome. The outcome is in general, a random variable whose distribution depends on the action pair (i,j). We assume that the outcome is two valued: +1, (unit gain) and −1 (unit loss) and that neither person has knowledge of the set of actions available to the other person or the actual action chosen by the other person at any instant of time or the distribution of the random outcome as a function of the pair (i,j) of actions. In other words, we consider an interaction between persons wherein there is no transfer of information of any kind at any stage. Just based on the action chosen and the random outcome he receives, each person decides to update the probability distribution over the set of his own actions using a learning algorithm. In this setup our problem is to find conditions on the learning algorithm such that asymptotically each person will maximize his expected outcome or payoff.

Suggested Citation

  • S. Lakshmivarahan, 1981. "Two Person Decentralized Team Problem With Incomplete Information," Springer Books, in: Learning Algorithms Theory and Applications, chapter 0, pages 197-227, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-5975-6_7
    DOI: 10.1007/978-1-4612-5975-6_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-5975-6_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.