About: Bishop–Cannings theorem

An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS (from their Theorem 3). The usefulness of the results comes from the fact that they can be used to directly find ESSes algebraically, rather than simulating the game and solving it by iteration. The logic of (i) also applies to Nash equilibria (all strategies in the support of a mixed strategy receive the same payoff).

Property Value
dbo:abstract
  • The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS (from their Theorem 3). The usefulness of the results comes from the fact that they can be used to directly find ESSes algebraically, rather than simulating the game and solving it by iteration. The logic of (i) also applies to Nash equilibria (all strategies in the support of a mixed strategy receive the same payoff). The theorem was formulated by and at Sheffield University, who published it in 1978. A review is given by John Maynard Smith in Evolution and the Theory of Games, with proof in the appendix. (en)
dbo:wikiPageID
  • 3164527 (xsd:integer)
dbo:wikiPageLength
  • 1669 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 903634084 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS (from their Theorem 3). The usefulness of the results comes from the fact that they can be used to directly find ESSes algebraically, rather than simulating the game and solving it by iteration. The logic of (i) also applies to Nash equilibria (all strategies in the support of a mixed strategy receive the same payoff). (en)
rdfs:label
  • Bishop–Cannings theorem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License