EconStor >
Northwestern University >
Kellogg School of Management - Center for Mathematical Studies in Economics and Management Science, Northwestern University  >
Discussion Papers, Kellogg School of Management, Northwestern University >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/31212
  
Title:Truthful revelation mechanisms for simultaneous common agency games PDF Logo
Authors:Pavan, Alessandro
Calzolari, Giacomo
Issue Date:2008
Series/Report no.:Discussion paper // Center for Mathematical Studies in Economics and Management Science 1458
Abstract:This paper considers games in which multiple principals contract simultaneously with the same agent. We introduce a new class of revelation mechanisms that, although it does not always permit a complete equilibrium characterization, it facilitates the characterization of the equilibrium outcomes that are typically of interest in applications (those sustained by pure-strategy pro.les in which the agent.s behavior in each relationship is Markov, i.e., it depends only on payoþ-relevant information such as the agent.s type and the decisions he is inducing with the other principals). We then illustrate how these mechanisms can be put to work in environments such as menu auctions, competition in nonlinear tariþs, and moral hazard settings. Lastly, we show how one can enrich the revelation mechanisms, albeit at a cost of an increase in complexity, to characterize also equilibrium outcomes sustained by non-Markov strategies and/or mixed-strategy profiles.
Subjects:Mechanism design
contracts
revelation principle
menus
endogenous payoff-relevant information.
JEL:D89
C72
Document Type:Working Paper
Appears in Collections:Discussion Papers, Kellogg School of Management, Northwestern University

Files in This Item:
File Description SizeFormat
605572917.PDF382.16 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/31212

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.