Cylinder Lottery.

The author presents a probabilistic game involving cylinders, each containing $100, in which a contestant aims to collect all the money in the fewest possible draws despite constraints like cylinder reshuffling, optional "cleanings" (removal of empty cylinders), and "refillings" (returning some empt...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 68; no. 1; pp. 100 - 101
Autor principal: Shasha, Dennis
Formato: Artículo
Publicado: Association for Computing Machinery Jan2025
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=hlh&AN=181806941&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 181806941
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jan2025
      vid: 68
      iid: 1
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        181806941
        10.1145/3702335
      ppf: 100
      ppct: 1
      formats:
      tig:
        atl: Cylinder Lottery.
      aug:
        au: Shasha, Dennis
        affil: New York University, Department of Computer Science, New York, NY, USA
      su:
        Games
        Dynamic programming
        Probability theory
      sug:
        subj:
          Games
          Dynamic programming
          Probability theory
      ab: The author presents a probabilistic game involving cylinders, each containing $100, in which a contestant aims to collect all the money in the fewest possible draws despite constraints like cylinder reshuffling, optional "cleanings" (removal of empty cylinders), and "refillings" (returning some empty cylinders). It presents solutions for scenarios with varying numbers of cylinders, cleanings, and refillings, demonstrating how strategic timing of cleanings can drastically reduce the expected number of draws, especially as the game complexity increases. The article suggests that dynamic programming can optimize strategies when balancing cleanings and refillings for minimal expected draws.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2025
    holdings:
      @attributes:
        islocal: N