Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Równowaga Nasha Bayesa× | Aukcja pierwszej ceny× | |
|---|---|---|
| Dziedzina | Teoria gier | Teoria gier |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1967 | 1961 |
| Twórca≠ | John Harsanyi | William Vickrey |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182. DOI ↗ | Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed bids. The Journal of Finance, 16(1), 8-37. DOI ↗ |
| Inne nazwy | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium | FPSB, Sealed-Bid Auction, Bid-Equal-Price Auction |
| Pokrewne | 4 | 4 |
| Podsumowanie≠ | 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. | A first-price auction is a sealed-bid mechanism where all participants submit bids simultaneously without knowing others' bids. The highest bidder wins and pays their own bid (the price they offered). Systematically analyzed by William Vickrey in 1961, first-price auctions require bidders to balance between winning and profit, leading to strategic underbidding relative to true valuations in equilibrium. |
| ScholarGateZbiór danych ↗ |
|
|