BREAKING NEWS
Cloud Server Hosting For Online Businesses
Inexpensive SEO Services
Benefits of Wanting to play Free Online Slot machines
Wilson doctrine (economics)

Summary

In economic theory, the Wilson doctrine (or Wilson critique) stipulates that game theory should not rely excessively on common knowledge assumptions. Most prominently, it is interpreted as a request for institutional designs to be "detail-free".[1] That is, mechanism designers should offer solutions that do not depend on market details (such as distributions or functional forms of payoff relevant signals) because they may be unknown to practitioners or are subject to intractable change. The name is due to Nobel laureate Robert Wilson, who argued:[2]

Game theory has a great advantage in explicitly analyzing the consequences of trading rules that presumably are really common knowledge; it is deficient to the extent it assumes other features to be common knowledge, such as one agent's probability assessment about another’s preferences or information. I foresee the progress of game theory as depending on successive reductions in the base of common knowledge required to conduct useful analyses of practical problems. Only by repeated weakening of common knowledge assumptions will the theory approximate reality.

While the above quote is often seen as the Wilson doctrine, mechanism design researchers derive an insistence on detail-free mechanisms from it. For instance, Partha Dasgupta and Eric Maskin,[3] as well as Mark Satterthwaite and Steven Williams,[4] attribute this insistence to Wilson. This interpretation might also go back to another paper by Wilson in which he praises the double auction because it "does not rely on features of the agents' common knowledge, such as their probability assessment".[5] While Wilson himself agrees with the spirit of demanding detail-free mechanisms, he is surprised to be credited for it.[6] In line with the above quote, Dirk Bergemann and Stephen Morris see the doctrine as a reminder of John Harsanyi's insight that common knowledge assumptions can be made explicit (and then relaxed) by enriching the type space with beliefs.[7] This interpretation gave rise to their notion of robust mechanism design.[8] An alternative approach to robust mechanism design assumes non-probabilistic uncertainty. For instance, Gabriel Carroll has a series of papers in which the principal evaluates outcomes on a worst-case basis.[6]

References edit

  1. ^ Bergemann, Dirk; Välimäki, Juuso (2006). "Information in Mechanism Design". In Blundell, Richard; Newey, Whitney K.; Persson, Torsten (eds.). Advances in Economics and Econometrics: Theory and Applications, Ninth World Congress. Vol. 1. Cambridge: Cambridge University Press. p. 206. ISBN 978-1-139-05226-9.
  2. ^ Wilson, Robert (1987-06-26), "Game-theoretic analyses of trading processes", Advances in Economic Theory, Cambridge University Press, pp. 33–70, doi:10.1017/ccol0521340446.002, ISBN 978-0-521-38925-9, retrieved 2021-06-04
  3. ^ Dasgupta, P.; Maskin, E. (2000-05-01). "Efficient Auctions". The Quarterly Journal of Economics. 115 (2): 341–388. doi:10.1162/003355300554755. ISSN 0033-5533.
  4. ^ Satterthwaite, Mark A.; Williams, Steven R. (2002). "The Optimality of a Simple Market Mechanism". Econometrica. 70 (5): 1841–1863. doi:10.1111/1468-0262.00355. hdl:10419/221612. ISSN 0012-9682.
  5. ^ Wilson, Robert (1985). "Incentive Efficiency of Double Auctions". Econometrica. 53 (5): 1101–1115. doi:10.2307/1911013. ISSN 0012-9682. JSTOR 1911013.
  6. ^ a b Carroll, Gabriel (2019-08-02). "Robustness in Mechanism Design and Contracting". Annual Review of Economics. 11 (1): 139–166. doi:10.1146/annurev-economics-080218-025616. ISSN 1941-1383. S2CID 21675002.
  7. ^ Bergemann, Dirk (2013). "An Introduction to Robust Mechanism Design". Foundations and Trends in Microeconomics. 8 (3): 169–230. doi:10.1561/0700000057. ISSN 1547-9846.
  8. ^ Bergemann, Dirk (2012). Robust mechanism design : the role of private information and higher order beliefs. Stephen Morris. Singapore: World Scientific Pub. ISBN 978-981-4374-59-0. OCLC 794263001.