ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

Gale-Shapley 算法×委托×
领域博弈论博弈论
方法族Machine learningMachine learning
起源年份19621976
提出者David Gale, Lloyd ShapleyMichael Jensen, William Meckling, Bengt Holmstrom
类型algorithmalgorithm
开创性文献Gale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1), 9-15. DOI ↗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. DOI ↗
别名Stable Marriage Problem, Deferred Acceptance, Two-Sided MatchingAgency Theory, Hidden Action Problem, Moral Hazard
相关44
摘要The Gale-Shapley algorithm solves the stable marriage problem: how to match two groups (e.g., medical residents to hospitals, students to schools) such that no pair prefers each other to their assigned partners. Introduced by David Gale and Lloyd Shapley in 1962, the algorithm guarantees a stable matching in polynomial time through a deferred acceptance process where one side proposes sequentially and the other side responds, revising choices as better options arrive.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Gale-Shapley Algorithm · Principal-Agent Model. 于 2026-06-17 检索自 https://scholargate.app/zh/compare