Essays on Repeated Games and Reputations - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Essays on Repeated Games and Reputations write by Ayçca Özdoḡan. This book was released on 2010. Essays on Repeated Games and Reputations available in PDF, EPUB and Kindle.
Essays on Reputation and Repeated Games
Essays on Reputation and Repeated Games - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Essays on Reputation and Repeated Games write by Benjamin Leonard Sperisen. This book was released on 2015. Essays on Reputation and Repeated Games available in PDF, EPUB and Kindle. This dissertation consists of three essays on reputation and repeated games. Reputation models typically assume players have full memory of past events, yet in many applications this assumption does not hold. In the first chapter, I explore two different relaxations of the assumption that history is perfectly observed in the context of Ely and Välimäki's (2003) mechanic game, where reputation (with full history observation) is clearly bad for all players. First I consider "limited history," where short-run players see only the most recent T periods. For large T, the full history equilibrium behavior always holds due to an "echo" effect (for high discount factors); for small T, the repeated static equilibrium exists. Second I consider "fading history," where short-run players randomly sample past periods with probabilities that "fade" toward zero for older periods. When fading is faster than a fairly lax threshold, the long-run player always acts myopically, a result that holds more generally for reputation games where the long-run player has a strictly dominant stage game action. This finding suggests that reputational incentives may be too weak to affect long-run player behavior in some realistic word-of-mouth environments. The second chapter develops general theoretical tools to study incomplete information games where players observe only finitely many recent periods. I derive a recursive characterization of the set of equilibrium payoffs, which allows analysis of both stationary and (previously unexplored) non-stationary equilibria. I also introduce "quasi-Markov perfection," an equilibrium refinement which is a necessary condition of any equilibrium that is "non-fragile" (purifiable), i.e., robust to small, additively separable and independent perturbations of payoffs. These tools are applied to two examples. The first is a product choice game with 1-period memory of the firm's actions, obtaining a complete characterization of the exact minimum and maximum purifiable equilibrium payoffs for almost all discount factors and prior beliefs on an "honest" Stackelberg commitment type, which shows that non-stationary equilibria expand the equilibrium set. The second is the same game with long memory: in all stationary and purifiable equilibria, the long-run player obtains exactly the Stackelberg payoff so long as the memory is longer than a threshold dependent on the prior. These results show that the presence of the honest type (even for arbitrarily small prior beliefs) qualitatively changes the equilibrium set for any fixed discount factor above a threshold independent of the prior, thereby not requiring extreme patience. The third chapter studies the question of why drug trafficking organizations inflict violence on each other, and why conflict breaks out under some government crackdowns and not others, in a repeated games context. Violence between Mexican drug cartels soared following the government's anti-cartel offensive starting in 2006, but not under previous crackdowns. I construct a theoretical explanation for these observations and previous empirical research. I develop a duopoly model where the firms have the capacity to make costly attacks on each other. The firms use the threat of violence to incentivize inter-cartel cooperation, and under imperfect monitoring, violence occurs on the equilibrium path of a high payoff equilibrium. When a "corrupt" government uses the threat of law enforcement as a punishment for uncooperative behavior, violence is not needed as frequently to achieve high payoffs. When government cracks down indiscriminately, the firms may return to frequent violence as a way of ensuring cooperation and high payoffs, even if the crackdown makes drug trafficking otherwise less profitable.
Essays on Dynamic Games and Reputations
Essays on Dynamic Games and Reputations - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Essays on Dynamic Games and Reputations write by Di Pei (Ph. D.). This book was released on 2018. Essays on Dynamic Games and Reputations available in PDF, EPUB and Kindle. This thesis consists of three essays on dynamic games with incomplete information. In Chapter 1, I study reputation effects when individuals have persistent private information that matters for their opponents' payoffs. I examine a repeated game between a patient informed player and a sequence of myopic uninformed players. The informed player privately observes a persistent state, and is either a strategic type who can flexibly choose his actions or is one of the several commitment types that mechanically plays the same action in every period. Unlike the canonical models on reputation effects, the uninformed players' payoffs depend on the state. This interdependence of values introduces new challenges to reputation building, namely, the informed player could face a tradeo between establishing a reputation for commitment and signaling favorable information about the state. My results address the predictions on the informed player's payoff and behavior that apply across all Nash equilibria. When the stage game payoffs satisfy a monotone-supermodularity condition, I show that the informed long-run player can overcome the lack-of-commitment problem and secure a high payoff in every state and in every equilibrium. Under a condition on the distribution over states, he will play the same action in every period and maintain his reputation for commitment in every equilibrium. If the payoff structure is unrestricted and the probability of commitment types is small, then the informed player's return to reputation building can be low and can provide a strict incentive to abandon his reputation. In Chapter 2, I study the dynamics of an agent's reputation for competence when the labor market's information about his performance is disclosed by an intermediary who cannot commit. I show that this game admits a unique Markov Perfect Equilibrium (MPE). When the agent is patient, his effort is inverse U-shaped, while the rate of information disclosure is decreasing over time. I illustrate the inefficiencies of the unique MPE by comparing it with the equilibrium in the benchmark scenario where the market automatically observes all breakthroughs. I characterize a tractable subclass of non-Markov Equilibria and explain why allowing players to coordinate on payoff-irrelevant events can improve eciency on top of the unique MPE and the exogenous information benchmark. When the intermediary can commit, her optimal Markov disclosure policy has a deadline, after which no breakthrough will be disclosed. However, deadlines are not incentive compatible in the game without commitment, illustrating a time inconsistency problem faced by the intermediary. My model can be applied to professional service industries, such as law and consulting. My results provide an explanation to the observed wage and promotion patterns in Baker, Gibbs and Holmström (1994). In Chapter 3, I study repeated games in which a patient long-run player (e.g. a rm) wishes to win the trust of some myopic opponents (e.g. a sequence or a continuum of consumers) but has a strict incentive to betray them. Her benet from betrayal is persistent over time and is her private information. I examine the extent to which persistent private information can overcome this lack-of-commitment problem. My main result characterizes the set of payoffs a patient long-run player can attain in equilibrium. Interestingly, every type's highest equilibrium payoff only depends on her true benet from betrayal and the lowest possible benet in the support of her opponents' prior belief. When this lowest possible benet vanishes, every type can approximately attain her Stackelberg commitment payoff. My finding provides a strategic foundation for the (mixed) Stackelberg commitment types in the reputation models, both in terms of the highest attainable payoff and in terms of the commitment behaviors. Compared to the existing approaches that rely on the existence of crazy types that are either irrational or have drastically dierent preferences, there is common knowledge of rationality in my model, and moreover, players' ordinal preferences over stage game outcomes are common knowledge.
Reputation and Cooperation in Repeated Games
Reputation and Cooperation in Repeated Games - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Reputation and Cooperation in Repeated Games write by Joel Watson. This book was released on 1992. Reputation and Cooperation in Repeated Games available in PDF, EPUB and Kindle.
Repeated Games and Reputations
Repeated Games and Reputations - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Repeated Games and Reputations write by George J. Mailath. This book was released on 2006-09-28. Repeated Games and Reputations available in PDF, EPUB and Kindle. Personalized and continuing relationships play a central role in any society. Economists have built upon the theories of repeated games and reputations to make important advances in understanding such relationships. Repeated Games and Reputations begins with a careful development of the fundamental concepts in these theories, including the notions of a repeated game, strategy, and equilibrium. Mailath and Samuelson then present the classic folk theorem and reputation results for games of perfect and imperfect public monitoring, with the benefit of the modern analytical tools of decomposability and self-generation. They also present more recent developments, including results beyond folk theorems and recent work in games of private monitoring and alternative approaches to reputations. Repeated Games and Reputations synthesizes and unifies the vast body of work in this area, bringing the reader to the research frontier. Detailed arguments and proofs are given throughout, interwoven with examples, discussions of how the theory is to be used in the study of relationships, and economic applications. The book will be useful to those doing basic research in the theory of repeated games and reputations as well as those using these tools in more applied research.
