Interacting mechanisms: A perspective on generalized principal–agent problems

Françoise Forges, Frederic Koessler and Andrés Salamanca

Journal of Mathematical Economics, 2024, vol. 114, issue C

Abstract: Myerson (1982) formalizes general principal–agent problems, in which agents have private information and choose actions. His contribution is best known for a version of the revelation principle in the case of a single principal but he also introduces a model of interacting principals. We push the latter forward by studying the perfect Bayesian equilibrium outcomes of the corporations’ game in which every principal proposes a mechanism to his agents. We show that several versions of the revelation principle hold in our framework and that, under certain conditions, every principals’ equilibrium, as defined in Myerson (1982), is a perfect Bayesian equilibrium outcome of the corporations’ game.

Keywords: Communication equilibrium; Corporations; Correlated equilibrium; Mechanism design; Multiple principals; Perfect Bayesian equilibrium; Revelation principle; Robust equilibrium (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406824000831
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Interacting mechanisms: a perspective on generalized principal-agent problems (2024)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:114:y:2024:i:c:s0304406824000831

DOI: 10.1016/j.jmateco.2024.103023

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().