Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Equilibrio de Nash Bayesiano× | Subasta de primer precio× | |
|---|---|---|
| Campo | Teoría de juegos | Teoría de juegos |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1967 | 1961 |
| Autor original≠ | John Harsanyi | William Vickrey |
| Tipo | algorithm | algorithm |
| Fuente seminal≠ | 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 ↗ |
| Alias | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium | FPSB, Sealed-Bid Auction, Bid-Equal-Price Auction |
| Relacionados | 4 | 4 |
| Resumen≠ | 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. |
| ScholarGateConjunto de datos ↗ |
|
|