Monotone optimal decision rules and their computation (Q1060790): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing a Submodular Function on a Lattice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144550 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On monotone optimal decision rules and the stay-on-a-winner rule for the two-armed bandit / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5532825 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Statistical decision theory. Foundations, concepts, and methods / rank | |||
Normal rank | |||
Latest revision as of 17:22, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotone optimal decision rules and their computation |
scientific article |
Statements
Monotone optimal decision rules and their computation (English)
0 references
1986
0 references
For a given objective function w(x,a) on \(X\times A\), a maximizing \(a=\delta (x)\) has to be determined for each x in the totally ordered set X. We give conditions on w such that there is a monotone \(\delta\) which can be computed recursively if A is finite.
0 references
optimal decision rules
0 references
monotone maximizers
0 references
computation of maximizers
0 references
0 references
