Beating humans in a penny-matching game by leveraging cognitive hierarchy theory and Bayesian learning

September 27, 2019 Β· Declared Dead Β· πŸ› American Control Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ran Tian, Nan Li, Ilya Kolmanovsky, Anouck Girard arXiv ID 1909.12701 Category cs.AI: Artificial Intelligence Cross-listed cs.GT, cs.LG Citations 11 Venue American Control Conference Last Checked 4 months ago
Abstract
It is a long-standing goal of artificial intelligence (AI) to be superior to human beings in decision making. Games are suitable for testing AI capabilities of making good decisions in non-numerical tasks. In this paper, we develop a new AI algorithm to play the penny-matching game considered in Shannon's "mind-reading machine" (1953) against human players. In particular, we exploit cognitive hierarchy theory and Bayesian learning techniques to continually evolve a model for predicting human player decisions, and let the AI player make decisions according to the model predictions to pursue the best chance of winning. Experimental results show that our AI algorithm beats 27 out of 30 volunteer human players.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted