On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions (Q1049229): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jmateco.2009.06.003 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041584748 / rank | |||
Revision as of 06:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions |
scientific article |
Statements
On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions (English)
0 references
8 January 2010
0 references
The paper deals with a rather special problem of the non-cooperative games theory. Namely, two-person games of private information, analyzed in two previous papers referred in this work, are investigated, and the existence theorem for the Bayesian-Nash equilibrium is, for those games, extended from pure to mixed strategies. The extension is provided by means of the purification of the mixed strategies. This procedure is theoretically supported by general methods of functional analysis and measure theory.
0 references
two-person game
0 references
atomless game
0 references
independent private information
0 references
countably infinite actions
0 references
countably infinite partitions
0 references
DWW theorem
0 references
