• DocumentCode
    294354
  • Title

    Superior information is insufficient to win in games between finite automata

  • Author

    Chernorutskii, Vladimir ; Izmailov, Rauf ; Pokrovskii, Alexei

  • Author_Institution
    Inst. for Inf. Transmission Problems, Moscow, Russia
  • Volume
    3
  • fYear
    1995
  • fDate
    13-15 Dec 1995
  • Firstpage
    3044
  • Abstract
    A game between two computers is considered: the first computer generates a binary sequence while the second one tries to predict the next element of this sequence using the previous elements. Both computers operate with the same pool of strategies, which is the set of all boolean functions of N arguments. Notwithstanding the asymmetry of the game, it turns out that the value of the game is zero. An algorithm for choosing an optimal superstrategy for the first computer is proposed
  • Keywords
    Boolean functions; binary sequences; finite automata; game theory; graph theory; minimisation; binary sequence; boolean functions; finite automata; optimal superstrategy; Australia; Automata; Boolean functions; Data mining; History; Laboratories; National electric code;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
  • Conference_Location
    New Orleans, LA
  • ISSN
    0191-2216
  • Print_ISBN
    0-7803-2685-7
  • Type

    conf

  • DOI
    10.1109/CDC.1995.478611
  • Filename
    478611
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=294354