2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/216937We present a couple of adaptive learning models of poker-like games, by means of which we show how bluffing strategies emerge very naturally, and can also be rational and evolutively stable. Despite their very simple learning algorithms, agents learn to bluff, and the best bluffing player is usually the winner.In a slightly different version, this article is a chapter of the Ph.D. thesis of Andrea GuazziniPhysics and SocietyPopular PhysicsThe emergence of bluff in poker-like gamestext