Value of information in the Polya urn process
Several one-person games based on the Polya urn are considered. Typically the authors consider a decision problem, and a variant of this decision problem where the player has, in addition, some information available. The value of information is then defined as: the expected utility of optimally solving the decision problem with the information, minus the expected utility of optimally solving the decision problem without the information. The authors nicely compute several values. In several cases, additionnal information will not affect the betting strategy of the player.
- A note on risk and the value of information
- Adaptive growth processes modeled by URN schemes
- Equivalent Comparisons of Experiments
- scientific article; zbMATH DE number 3122709 (Why is no real title available?)
- scientific article; zbMATH DE number 3765564 (Why is no real title available?)
- scientific article; zbMATH DE number 3573646 (Why is no real title available?)
- scientific article; zbMATH DE number 4001094 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Information structure: Common and private (Corresp.)
- Market signaling: An example of a two-person decision problem with dynamic information structure
- Partition structures, Polya urns, the Ewens sampling formula, and the ages of alleles
- Private information structures ofAwith respect toB
- The asymptotic behavior of an urn model arising
- The sampling theory of neutral alleles and an urn model in population genetics
- The value of information in a sealed-bid auction
- The value of information: The case of signal-dependent opportunity sets
- Why a Population Converges to Stability
This page was built for publication: Value of information in the Polya urn process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857038)