Signal decoding with help of finite automata: application to games with incomplete information

zbMATH Open1422.91127MaRDI QIDQ5229993FDOQ5229993

Authors: Misha Gavrilovich, Victoria L. Kreps 

Publication date: 19 August 2019

Full work available at URL: http://mathnet.ru/eng/mgta229

Recommendations

• Games with Symmetric Incomplete Information and Asymmetric Computational Resources
• Games with incomplete information on the both sides and with public signal on the state of the game
• Codification schemes and finite automata
• scientific article; zbMATH DE number 3852939
• Markov games with incomplete information

zbMATH Keywords

asymmetryfinite automataincomplete informationmatrix gamebinary code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Signaling and communication in game theory (91A28) Decoding (94B35)

Cites Work

• Elements of automata theory. Translated from the French by Reuben Thomas
• Repeated games with incomplete information. With the collaboration of Richard E. Stearns
• Finitely repeated games with finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• Stirling's Approximation for n!: The Ultimate Short Proof?
• Title not available (Why is that?)
• Games with Symmetric Incomplete Information and Asymmetric Computational Resources

Cited In (3)

• Games with incomplete information on the both sides and with public signal on the state of the game
• Codification schemes and finite automata
• Title not available (Why is that?)

This page was built for publication: Signal decoding with help of finite automata: application to games with incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229993)