A new model of persuasion is presented. A listener first announces and commits to a codex (i.e., a set of conditions). The speaker then presents a (not necessarily true) profile that must satisfy the codex in order for the listener to be persuaded. The speaker is boundedly rational in the sense that his ability to come up with a persuasive profile is limited and depends on the true profile and the content and framing of the codex. The circumstances under which the listener can design a codex that will implement his goal are fully characterized.

We study experimentally a new two-player game: each player requests an amount between 11 and 20 shekels. He receives the requested amount and if he requests exactly one shekel less than the other player, he receives an additional 20 shekels. Level-k reasoning is appealing due to the natural starting point (requesting 20) and the straightforward best-response operation. Nevertheless, almost all subjects exhibit at most three levels of reasoning. Two variants of the game demonstrate that the depth of reasoning is not increased by enhancing the attractiveness of the level-0 strategy or by reducing the cost of undercutting the other player.