Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Vikrija-Klārka-Grova mehānisms× | Beijesa Neša līdzsvars× | |
|---|---|---|
| Nozare | Spēļu teorija | Spēļu teorija |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 1961 | 1967 |
| Autors≠ | William Vickrey, Edward Clarke, Theodore Groves | John Harsanyi |
| Tips | algorithm | algorithm |
| Pirmavots≠ | Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed bids. The Journal of Finance, 16(1), 8-37. DOI ↗ | Harsanyi, J. C. (1967). Games with incomplete information played by Bayesian players, Parts I, II, and III. Management Science, 14(3), 159-182. DOI ↗ |
| Citi nosaukumi | Vickrey Mechanism, Generalized Vickrey Auction, Truthful Mechanism | BNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium |
| Saistītās | 4 | 4 |
| Kopsavilkums≠ | The Vickrey-Clarke-Groves (VCG) Mechanism is a truthful mechanism design solution that allocates resources and determines payments to incentivize participants to reveal their true valuations. Building on William Vickrey's 1961 sealed-bid auction work and extended by Clarke and Groves, VCG ensures that reporting truth is a dominant strategy for all participants, achieving allocative efficiency while maximizing total surplus. | 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. |
| ScholarGateDatu kopa ↗ |
|
|