ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Model náhodné užitečnosti×Bayesovská Nashova rovnováha×
OborTeorie herTeorie her
RodinaMachine learningMachine learning
Rok vzniku19741967
TvůrceDaniel McFaddenJohn Harsanyi
Typalgorithmalgorithm
Původní zdrojMcFadden, D. (1974). Conditional logit analysis of qualitative choice behavior. In P. Zarembka (Ed.), Frontiers in Econometrics (pp. 105-142). Academic Press. 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 ↗
Další názvyDiscrete Choice Model, Probabilistic Choice, Stochastic UtilityBNE, Perfect Bayesian Equilibrium, Type-Contingent Equilibrium
Příbuzné44
ShrnutíThe Random Utility Model explains discrete choice behavior by assuming agents derive uncertain utilities from alternatives and choose the option yielding highest utility. Introduced by Daniel McFadden in 1974, the model decomposes utility into systematic (observable) and random (idiosyncratic) components, permitting probabilistic choice predictions. The logit model, a parametric specification, yields closed-form choice probabilities that are widely used in marketing, transportation, and environmental valuation.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Random Utility Model · Bayesian Nash Equilibrium. Získáno 2026-06-15 z https://scholargate.app/cs/compare