手法を比較

	トップ・トレーディング・サイクル	プリンシパル・エージェント・モデル
分野	ゲーム理論	ゲーム理論
系統	Machine learning	Machine learning
提唱年	1974	1976
提唱者	Lloyd Shapley, Herbert Scarf	Michael Jensen, William Meckling, Bengt Holmstrom
種類	algorithm	algorithm
原典	Shapley, L. S., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23-37.	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.
別名	TTC, Shapley-Scarf Algorithm, Efficient Exchange	Agency Theory, Hidden Action Problem, Moral Hazard
関連	4	4
概要	Top Trading Cycles (TTC) is an algorithm for allocating indivisible goods to agents such that the allocation is Pareto efficient and individually rational. Developed by Lloyd Shapley and Herbert Scarf in 1974, the algorithm identifies cycles of trades in a preference digraph, executes those trades, and iteratively repeats until no further trades are beneficial. TTC is widely used in kidney exchange and housing allocation due to its efficiency and implementation simplicity.	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.