Comparison of information structures for zero-sum games and a partial converse to Blackwell ordering in standard Borel spaces

Abstract: In statistical decision theory involving a single decision-maker, an information structure is said to be better than another one if for any cost function involving a hidden state variable and an action variable which is restricted to be conditionally independent from the state given some measurement, the solution value under the former is not worse than that under the latter. For finite spaces, a theorem due to Blackwell leads to a complete characterization on when one information structure is better than another. For stochastic games, in general, such an ordering is not possible since additional information can lead to equilibria perturbations with positive or negative values to a player. However, for zero-sum games in a finite probability space, Pk{e}ski introduced a complete characterization of ordering of information structures. In this paper, we obtain an infinite dimensional (standard Borel) generalization of Pk{e}ski's result. A corollary is that more information cannot hurt a decision maker taking part in a zero-sum game. We establish two supporting results which are essential and explicit though modest improvements on prior literature: (i) a partial converse to Blackwell's ordering in the standard Borel setup and (ii) an existence result for equilibria in zero-sum games with incomplete information.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Comparison of information structures for zero-sum games and a partial converse to Blackwell ordering in standard Borel spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992012)