<p>Dilmé (Internat J Game Theory 53:673 <CitationRef CitationID="CR2">2024</CitationRef>) shows that an assessment is Kreps-Wilson (1982) consistent if and only if it is the limit of a particularly simple kind of sequence of strictly mixed strategies—which Dilmé calls a “power sequence”—and its associated sequence of Bayes-rule induced beliefs. We use Farkas’ lemma to provide a brief and simple proof of Dilmé’s result.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A simple proof of the sufficiency of Dilmé’s power-sequence test for Kreps-Wilson consistency

  • Philip J. Reny

摘要

Dilmé (Internat J Game Theory 53:673 2024) shows that an assessment is Kreps-Wilson (1982) consistent if and only if it is the limit of a particularly simple kind of sequence of strictly mixed strategies—which Dilmé calls a “power sequence”—and its associated sequence of Bayes-rule induced beliefs. We use Farkas’ lemma to provide a brief and simple proof of Dilmé’s result.