Answers are grounded in this paper and cite their sources.
We present a simple adaptive learning model of a poker-like game, by means of which we show how a bluffing strategy emerges very naturally and can also be rational and evolutionarily stable. Despite their very simple learning algorithms, agents learn to bluff, and the most bluffing player is usually the winner.
No takes yet. Share an insight, caveat, or question.
Guazzini et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: