Incomplete learning from endogenous data in dynamic allocation.

The writers examine the problem of incomplete learning from endogenous data in dynamic allocation. They note that this problem is commonly referred to as the “discounted multi-armed bandit problem” and that the optimal solution has been shown to be the “index rule” that selects at each stage the ac...

Descripción completa

Detalles Bibliográficos
Publicado en:Econometrica Vol. 68; no. 6; pp. 1511 - 1517
Autores principales: Brezzi, Monica, Lai, Tze Leung
Formato: Artículo
Publicado: Wiley-Blackwell November 2000
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=513036672&site=ehost-live
header:
  @attributes:
    shortDbName: ssf
    uiTerm: 513036672
    longDbName: Social Sciences Full Text (H.W. Wilson)
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00129682
        ECN
      jtl: Econometrica
      issn: 00129682
      maglogo: N
    pubinfo:
      dt: November 2000
      vid: 68
      iid: 6
      pid: 480
      pub: Wiley-Blackwell
    artinfo:
      ui:
        513036672
        10.1111/1468-0262.00170
      ppf: 1511
      ppct: 6
      formats:
      tig:
        atl: Incomplete learning from endogenous data in dynamic allocation.
      aug:
        au:
          Brezzi, Monica
          Lai, Tze Leung
      su:
        Sequential analysis
        Resource allocation -- Mathematical models
        Psychology of learning
        Mathematical models
      sug:
        subj:
          Sequential analysis
          Resource allocation -- Mathematical models
          Psychology of learning
          Mathematical models
      ab: The writers examine the problem of incomplete learning from endogenous data in dynamic allocation. They note that this problem is commonly referred to as the “discounted multi-armed bandit problem” and that the optimal solution has been shown to be the “index rule” that selects at each stage the action with the largest “dynamic allocation index.” They provide a simple proof of the incompleteness of optimal learning from endogenous data in the discounted multi-armed bandit problem. They offer a comprehensive theory about the limits of beliefs and actions that solves completely, in the context of discounted multi-armed bandits, the basic problem regarding the extent of experimentation and the long-run beliefs and actions of optimizing agents who learn by doing.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: N
    holdings:
      @attributes:
        islocal: N