방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 쿠르노 경쟁× | 베이지안 내쉬 균형× | |
|---|---|---|
| 분야 | 게임이론 | 게임이론 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1838 | 1967 |
| 창시자≠ | Augustin-Louis Cournot | John Harsanyi |
| 유형 | algorithm | algorithm |
| 원전≠ | Cournot, A. A. (1838). Recherches sur les principes mathématiques de la théorie des richesses. L. Hachette. link ↗ | Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182. DOI ↗ |
| 별칭 | Quantity Competition, Cournot Equilibrium, Cournot-Nash Equilibrium | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium |
| 관련 | 4 | 4 |
| 요약≠ | Cournot Competition models oligopolistic markets where firms choose quantities simultaneously, not prices. Originally formulated by Augustin-Louis Cournot in 1838, the model assumes each firm's profit depends on the total market quantity produced. The resulting Cournot-Nash Equilibrium captures the strategic interaction where each firm maximizes profit given competitors' quantities, leading to prices between monopoly and perfect competition levels. | Bayesian Nash Equilibrium (BNE) extends Nash Equilibrium to games with incomplete information, where players lack full knowledge of others' payoff functions. Introduced by John Harsanyi in 1967, BNE models strategic interaction under uncertainty by representing unknown payoffs as players' private types drawn from a probability distribution. Equilibrium is found by solving for type-contingent strategies that are best responses to all possible type realizations. |
| ScholarGate데이터셋 ↗ |
|
|