About: Wilson doctrine (economics)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FWilson_doctrine_%28economics%29&invfp=IFP_OFF&sas=SAME_AS_OFF

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". 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:

AttributesValues
rdfs:label
  • Wilson doctrine (economics) (en)
rdfs:comment
  • 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". 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: (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • 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". 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: 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, as well as Mark Satterthwaite and Steven Williams, 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". While Wilson himself agrees with the spirit of demanding detail-free mechanisms, he is surprised to be credited for it. 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. This interpretation gave rise to their notion of robust mechanism design. 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. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software