Comparer des méthodes

	Modèle Principal-Agent	Équilibre de Nash
Domaine	Théorie des jeux	Théorie des jeux
Famille	Machine learning	Machine learning
Année d'origine	1976	1950
Auteur d'origine	Michael Jensen, William Meckling, Bengt Holmstrom	John Nash
Type	algorithm	algorithm
Source fondatrice	Jensen, M. C., & Meckling, W. H. (1976). Theory of the firm: Managerial behavior, agency costs and ownership structure. Journal of Financial Economics, 3(4), 305-360.	Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49.
Alias	Agency Theory, Hidden Action Problem, Moral Hazard	Lemke-Howson Equilibrium, Completely Labeled Pair
Apparentées	4	4
Résumé	The Principal-Agent Model analyzes how a principal (e.g., owner, employer, policymaker) can incentivize an agent (e.g., manager, employee, firm) to act in the principal's interest when the agent has private information or can take hidden actions. Formalized by Jensen and Meckling in 1976, the model identifies agency costs arising from moral hazard (the agent exerts less effort than desired) and adverse selection (the agent hides unfavorable information). Optimal contracts balance incentives with risk allocation.	Nash Equilibrium is a game-theoretic solution concept where no player can unilaterally deviate to improve their payoff. Formalized by John Nash in 1950, the Lemke-Howson algorithm computationally finds equilibria in bimatrix games by identifying completely labeled vertex pairs in the strategy polytopes.