Show simple item record

Essays on Mechanism Design

dc.contributor.authorSmith, Douglas Scotten_US
dc.date.accessioned2012-01-26T20:06:08Z
dc.date.availableNO_RESTRICTIONen_US
dc.date.available2012-01-26T20:06:08Z
dc.date.issued2011en_US
dc.date.submitteden_US
dc.identifier.urihttps://hdl.handle.net/2027.42/89795
dc.description.abstractMechanism design uses game theory to analyze how to construct mechanisms that give agents incentives to produce an outcome as optimal as possible for the mechanism designer. My dissertation is on robust mechanism design, where the mechanism designer has a great deal of uncertainty about what agents believe about other agents' preferences and beliefs. Much research on robust mechanism design has focused on finding "dominant strategy mechanisms," where agents' equilibrium actions depend only on their preferences and not their beliefs about the other agents. Focusing on such mechanisms makes uncertainty about agents' beliefs irrelevant. Chapters 2 through 5 of my dissertation explore how effective dominant strategy mechanisms are at achieving mechanism designers' goals. Mechanisms are compared by considering performance of the mechanisms for a wide range of possible agent preferences and beliefs, and then defining one mechanism as an improvement on another mechanism if it performs as well (and sometimes better) for every possible realization of agents’ preferences and beliefs. The first two chapters explore this question in the context of a public good problem. Chapter 2 demonstrates that there are mechanisms that improve on the dominant strategy mechanisms in the sense just described; Chapter 3 examines the usefulness of this efficiency concept by providing an example of a mechanism that is both very simple and unimprovable. The fourth and fifth chapters are coauthored with Tilman Borgers and look at the same question for the voting problem, where dominant strategy mechanisms are (random) dictatorships. Chapter 4 shows that random dictatorship can be improved on if the mechanism designer wants to maximize agents’ expectation of their welfare, but not ex post welfare. Chapter 5 shows the same results when the designer wants to maximize the sum of two agents’ welfare. The last chapter, Chapter 6, is coauthored with Mary Rigdon and reports on an experiment designed to investigate whether seemingly altruistic behavior is actually a response to strategic incentives, by using pre-commitment of some agents to test whether agents act differently when their actions can’t influence others’ future actions. Our data support the hypothesis that agents are motivated by social concerns.en_US
dc.language.isoen_USen_US
dc.subjectMechanism Designen_US
dc.subjectGame Theoryen_US
dc.subjectMicroeconomic Theoryen_US
dc.titleEssays on Mechanism Designen_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineEconomicsen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.contributor.committeememberBorgers, Tilman M.en_US
dc.contributor.committeememberChen, Yanen_US
dc.contributor.committeememberLauermann, Stephanen_US
dc.contributor.committeememberSmith, Lones A.en_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/89795/1/dougecon_1.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

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.