방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 샤플리 값× | 내쉬 균형× | |
|---|---|---|
| 분야 | 게임이론 | 게임이론 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1953 | 1950 |
| 창시자≠ | Lloyd Shapley | John Nash |
| 유형 | 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 ↗ | Nash, J. F. (1950). Equilibrium points in N-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49. DOI ↗ |
| 별칭≠ | Fair Division, Cooperative Game Solution, Dividend Vector | Lemke-Howson Equilibrium, Completely Labeled Pair |
| 관련 | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|