Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Konkurencja Cournota× | Równowaga Nasha Bayesa× | |
|---|---|---|
| Dziedzina | Teoria gier | Teoria gier |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1838 | 1967 |
| Twórca≠ | Augustin-Louis Cournot | John Harsanyi |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | 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 ↗ |
| Inne nazwy | Quantity Competition, Cournot Equilibrium, Cournot-Nash Equilibrium | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium |
| Pokrewne | 4 | 4 |
| Podsumowanie≠ | 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. |
| ScholarGateZbiór danych ↗ |
|
|