| dc.description.abstract | This dissertation consists of three research papers on cheap talk game and satisficing behaviour. The first chapter examines the potential for communication via cheap talk between an expert and a decision maker whose type (preferences) is uncertain. The expert privately observes states for each type of the decision maker and wants to persuade the decision maker to choose an action in his favour by informing her of the states. The decision maker privately observes her type and chooses an action. An optimal action for the decision maker depends upon both her type and type-specific states. In equilibrium the expert can always inform the decision maker in the form of comparative statements and the decision maker also can partially reveal her type to the expert or public. The second and third chapters build a dynamic model of satisficing behaviour in which an agent’s “expected” payoff is explicitly introduced, where this expectation is adaptively formed. If the agent receives a payoff above her satisficing level she continues with the current action, updating her valuation of the action. If she receives a payoff below her satisficing level and her valuation falls below her satisficing level she updates both her action and satisficing level. In the second chapter, we find that in the long run, all players satisfice. In individual decision problems, satisficing behaviour results in cautious, maximin choice and in normal form games like the Prisoner’s Dilemma and Stag Hunt, they in the long run play either cooperative or defective outcomes conditional on past plays. In coordination games like the Battle of the Sexes, Choosing Sides and Common Interest, they in the long run coordinate on Pareto optimal outcomes. In the third chapter, we find that satisficing players in the long run play subgame dominant paths, which is a refinement of subgame perfection, and identify conditions with which they ‘always cooperate’ or ‘fairly coordinate’ in repeated Prisoner’s Dilemma and Battle of the Sexes games, respectively, and truthfully communicate in sender-receiver games. Proofs and simulations are provided in appendices. | en_GB |
