方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Shapley值× | 顶尖交易循环× | |
|---|---|---|
| 领域 | 博弈论 | 博弈论 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1953 | 1974 |
| 提出者≠ | Lloyd Shapley | Lloyd Shapley, Herbert Scarf |
| 类型 | algorithm | algorithm |
| 开创性文献≠ | Shapley, L. S. (1953). A value for n-person games. In H. W. Kuhn & A. W. Tucker (Eds.), Contributions to the Theory of Games II (pp. 307-317). Princeton University Press. DOI ↗ | Shapley, L. S., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23-37. DOI ↗ |
| 别名 | Fair Division, Cooperative Game Solution, Dividend Vector | TTC, Shapley-Scarf Algorithm, Efficient Exchange |
| 相关 | 4 | 4 |
| 摘要≠ | The Shapley Value is a solution concept for coalition games that distributes total payoff fairly among players based on their marginal contributions to coalitions. Introduced by Lloyd Shapley in 1953, the Shapley Value is the unique payoff distribution that satisfies four intuitive axioms: efficiency (total payoff is distributed), symmetry (identical players receive equal payoff), null player (players contributing nothing receive nothing), and additivity across games. | 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. |
| ScholarGate数据集 ↗ |
|
|