Skip to content
Kudos AI

Games with Incomplete Information Played by Bayesian Players

John C. Harsanyi · 1967 · Management Science, 14, 159–182

Game TheoryProbabilityView source ↗

Summary

Shows how games in which players are uncertain about one another’s payoffs can be transformed into games of complete but imperfect information, by treating each player as having a randomly assigned "type".

Why it matters

It made strategic analysis possible when players do not know what their opponents value, which is the normal case outside textbook examples. The construction underpins modern auction theory and mechanism design, where bidders’ valuations are private.