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

Abstract 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.

Authors

Institutions

Publication Details

Journal
International Journal of Game Theory
Published
2026-05-22
DOI
https://doi.org/10.1007/s00182-026-00997-z
Primary Topic
Game Theory and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Philip J. Reny
International Journal of Game Theory
Game Theory and Applications
article

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

Philip J. Reny
article en

Abstract

Abstract 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.

International Journal of Game TheoryVol. 55(1)
University of Chicago (US)
Openalex Percentile: Top 4%
Game Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.