Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.08107 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908754444812288 |
|---|---|
| author | Fernández, Andrés Aradillas Blanchet, José Olea, José Luis Montiel Qiu, Chen Stoye, Jörg Tan, Lezhi |
| author_facet | Fernández, Andrés Aradillas Blanchet, José Olea, José Luis Montiel Qiu, Chen Stoye, Jörg Tan, Lezhi |
| contents | A decision rule is epsilon-minimax if it is minimax up to an additive factor epsilon. We present an algorithm for provably obtaining epsilon-minimax solutions for a class of statistical decision problems. In particular, we are interested in problems where the statistician chooses randomly among I decision rules. The minimax solution of these problems admits a convex programming representation over the (I-1)-simplex. Our suggested algorithm is a well-known mirror subgradient descent routine, designed to approximately solve the convex optimization problem that defines the minimax decision rule. This iterative routine is known in the computer science literature as the hedge algorithm and is used in algorithmic game theory as a practical tool to find approximate solutions of two-person zero-sum games. We apply the suggested algorithm to different minimax problems in the econometrics literature. An empirical application to the problem of optimally selecting sites to maximize the external validity of an experimental policy evaluation illustrates the usefulness of the suggested procedure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_08107 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Epsilon-Minimax Solutions of Statistical Decision Problems Fernández, Andrés Aradillas Blanchet, José Olea, José Luis Montiel Qiu, Chen Stoye, Jörg Tan, Lezhi Econometrics A decision rule is epsilon-minimax if it is minimax up to an additive factor epsilon. We present an algorithm for provably obtaining epsilon-minimax solutions for a class of statistical decision problems. In particular, we are interested in problems where the statistician chooses randomly among I decision rules. The minimax solution of these problems admits a convex programming representation over the (I-1)-simplex. Our suggested algorithm is a well-known mirror subgradient descent routine, designed to approximately solve the convex optimization problem that defines the minimax decision rule. This iterative routine is known in the computer science literature as the hedge algorithm and is used in algorithmic game theory as a practical tool to find approximate solutions of two-person zero-sum games. We apply the suggested algorithm to different minimax problems in the econometrics literature. An empirical application to the problem of optimally selecting sites to maximize the external validity of an experimental policy evaluation illustrates the usefulness of the suggested procedure. |
| title | Epsilon-Minimax Solutions of Statistical Decision Problems |
| topic | Econometrics |
| url | https://arxiv.org/abs/2509.08107 |