Information in Games.
dc.contributor.author | Cherry, Joshua Scott | en_US |
dc.date.accessioned | 2011-09-15T17:12:23Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2011-09-15T17:12:23Z | |
dc.date.issued | 2011 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/86380 | |
dc.description.abstract | In the first chapter, we tightly bound from the outside the set of sequential equilibrium payoffs in repeated games of private monitoring. To do this, we develop a tractable new solution concept for standard repeated games with perfect monitoring: Markov Perfect Correlated Equilibrium generalizes the operator approach of Abreu, Pearce and Stacchetti (1990), but instead takes correlated equilibrium of the auxiliary game. We show that for any private monitoring structure, the set of sequential equilibrium payoffs of a repeated game is contained within the set of Markov Perfect Correlated Equilibrium payoffs. The second chapter extends the Blackwell comparison of experiments to a strategic setting. We introduce a new partial order more strategically informative --- information held by players is "better'' --- and prove it is equivalent to the partial order more strategically valuable --- the ability to induce more equilibrium payoff vectors in all Bayesian games. The centerpiece application is to repeated games with private monitoring where the more strategically informative order ranks monitoring structures. Consequently, we can show when a change in monitoring structure will weakly expand the set of sequential equilibria. The third chapter deals with the tragedy of the commons. When effort imposes negative externalities, competition results in excessive aggregate effort. One way to curb these excesses is for subsets of competitors to form groups which share output or gross revenue. In theory, if the right number of groups forms, Nash equilibrium aggregate effort should fall to the socially optimal level. We investigate experimentally whether individuals manage to form the efficient number of groups and to invest within the chosen groups as theory predicts. Although we observe some systematic departures from theory, we find that subjects vote in most cases to divide themselves into the optimal number of output-sharing groups and, when investing within such groups, curtail inefficiency by 50% to 71%. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Game Theory | en_US |
dc.subject | Experimental Economics | en_US |
dc.title | Information in Games. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Economics | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Nakajima, Daisuke | en_US |
dc.contributor.committeemember | Smith, Lones A. | en_US |
dc.contributor.committeemember | Borgers, Tilman M. | en_US |
dc.contributor.committeemember | Masatlioglu, Yusuf Can | en_US |
dc.contributor.committeemember | Rajan, Uday | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/86380/1/jscherry_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.