{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T20:46:26Z","timestamp":1786999586885,"version":"build-2736575974"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T00:00:00Z","timestamp":1740614400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Econom. Theory"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:p>\n                    We study minimax regret treatment rules under\n                    <jats:italic>matched treatment assignment<\/jats:italic>\n                    in a setup where a policymaker, informed by a sample of size\n                    <jats:italic>N<\/jats:italic>\n                    , needs to decide between\n                    <jats:italic>T<\/jats:italic>\n                    different treatments for a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>T<\/mml:mi>\n                          <mml:mo>\u2265<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$T\\geq 2$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline1.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper T greater than or equals 2<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Randomized rules are allowed for. We show that the generalization of the minimax regret rule derived in Schlag (2006,\n                    <jats:italic>ELEVEN\u2014Tests needed for a recommendation<\/jats:italic>\n                    , EUI working paper) and Stoye (2009,\n                    <jats:italic>Journal of Econometrics<\/jats:italic>\n                    151, 70\u201381) for the case\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>T<\/mml:mi>\n                          <mml:mo>=<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$T=2$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline2.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper T equals 2<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is minimax regret for general finite\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>T<\/mml:mi>\n                          <mml:mo>&gt;<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$T&gt;2$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline3.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper T greater than 2<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and also that the proof structure via the Nash equilibrium and the \u201ccoarsening\u201d approaches generalizes as well. We also show by example, that in the case of\n                    <jats:italic>random assignment<\/jats:italic>\n                    the generalization of the minimax rule in Stoye (2009,\n                    <jats:italic>Journal of Econometrics<\/jats:italic>\n                    151, 70\u201381) to the case\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>T<\/mml:mi>\n                          <mml:mo>&gt;<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$T&gt;2$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline4.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper T greater than 2<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is not necessarily minimax regret and derive minimax regret rules for a few small sample cases, e.g., for\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>N<\/mml:mi>\n                          <mml:mo>=<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$N=2$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline5.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper N equals 2<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    when\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <mml:math xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xmlns:mnf=\"http:\/\/cambridge.org\/core\/manifest\" xmlns:cup=\"http:\/\/contentservices.cambridge.org\" xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" xmlns:m=\"http:\/\/cambridge.org\/core\/metadata\" xmlns:core=\"http:\/\/cambridge.org\/core\" xmlns:c=\"http:\/\/cambridge.org\/core\/content\" display=\"inline\">\n                          <mml:mi>T<\/mml:mi>\n                          <mml:mo>=<\/mml:mo>\n                          <mml:mn>3.<\/mml:mn>\n                        <\/mml:math>\n                        <jats:tex-math>$T=3.$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" content-type=\"simple\" xlink:href=\"S0266466625000040_inline6.png\">\n                          <jats:alt-text content-type=\"machine-generated\">upper T equals 3 period<\/jats:alt-text>\n                        <\/jats:inline-graphic>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                  <\/jats:p>\n                  <jats:p>\n                    In the case where a covariate\n                    <jats:italic>x<\/jats:italic>\n                    is included, it is shown that a minimax regret rule is obtained by using minimax regret rules in the \u201cconditional-on-\n                    <jats:italic>x<\/jats:italic>\n                    \u201d problem if the latter are obtained as Nash equilibria.\n                  <\/jats:p>","DOI":"10.1017\/s0266466625000040","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T04:46:55Z","timestamp":1740631615000},"page":"723-749","source":"Crossref","is-referenced-by-count":2,"title":["A NOTE ON MINIMAX REGRET RULES WITH MULTIPLE TREATMENTS IN FINITE SAMPLES"],"prefix":"10.1017","volume":"42","author":[{"given":"Haoning","family":"Chen","sequence":"first","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4395-5390","authenticated-orcid":false,"given":"Patrik","family":"Guggenberger","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2025,2,27]]},"reference":[{"key":"S0266466625000040_r16","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2004.00530.x"},{"key":"S0266466625000040_r29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jeconom.2011.06.012"},{"key":"S0266466625000040_r1","doi-asserted-by":"crossref","unstructured":"Aradillas Fern\u00e1ndez, A. , Blanchet, J. , Montiel Olea, J. L. , Qiu, C. , Stoye, J. , & Tan, L. (2024). $\\epsilon$ -Minimax solutions of statistical decision problems. Unpublished working paper. Cornell University.","DOI":"10.1145\/3736252.3742598"},{"key":"S0266466625000040_r32","unstructured":"Yata, K. (2023). Optimal decision rules under partial identification. Preprint, arXiv:2111.04926."},{"key":"S0266466625000040_r15","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699593"},{"key":"S0266466625000040_r22","volume-title":"The foundations of statistics","author":"Savage","year":"1954"},{"key":"S0266466625000040_r10","unstructured":"Guggenberger, P. , Mehta, N. , & Pavlov, N. (2024). Minimax regret treatment rules with finite samples when a quantile is the object of interest. Unpublished working paper. Pennsylvania State University."},{"key":"S0266466625000040_r17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2006.06.037"},{"key":"S0266466625000040_r21","doi-asserted-by":"publisher","DOI":"10.2307\/1969530"},{"key":"S0266466625000040_r6","doi-asserted-by":"publisher","DOI":"10.1002\/jae.583"},{"key":"S0266466625000040_r31","volume-title":"Statistical decision functions","author":"Wald","year":"1950"},{"key":"S0266466625000040_r26","doi-asserted-by":"publisher","DOI":"10.1525\/9780520313880-018"},{"key":"S0266466625000040_r7","unstructured":"Christensen, T. , Moon, R. , & Schorfheide, F. (2023). Optimal discrete decisions when payoffs are partially identified. Unpublished working paper."},{"key":"S0266466625000040_r3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729795"},{"key":"S0266466625000040_r19","doi-asserted-by":"publisher","DOI":"10.1007\/s42973-023-00147-0"},{"key":"S0266466625000040_r13","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA13288"},{"key":"S0266466625000040_r18","doi-asserted-by":"publisher","DOI":"10.1007\/s42973-023-00145-2"},{"key":"S0266466625000040_r9","unstructured":"Guggenberger, P. , & Huang, J. (2024). On the numerical approximation to minimax regret rules via fictitious play. Unpublished working paper. Pennsylvania State University."},{"key":"S0266466625000040_r28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jeconom.2009.02.013"},{"key":"S0266466625000040_r2","unstructured":"Aradillas Fern\u00e1ndez, A. , Olea, J. L. M. , Qiu, C. , Stoye, J. , & Tinda, S. (2024). Robust Bayes treatment choice with partial identification. Preprint, arXiv:2408.11621."},{"key":"S0266466625000040_r25","doi-asserted-by":"publisher","DOI":"10.1017\/S0266466613000327"},{"key":"S0266466625000040_r20","unstructured":"Montiel Olea, J. L. , Qiu, C. , & Stoye, J. (2023), Decision theory for treatment choice with partial identification. Preprint, arXiv:2312.17623."},{"key":"S0266466625000040_r8","first-page":"171","article-title":"Contributi all\u2019analisi sequenziale nel controllo di accettazione per variabili","volume":"6","author":"Cucconi","year":"1968","journal-title":"Atti dell\u2019 Associazione Italiana per il Controllo della Qualit\u00e0"},{"key":"S0266466625000040_r14","unstructured":"Kitagawa, T. , Lee, S. , & Qiu, C. (2024). Treatment choice with nonlinear regret. Preprint, arXiv:2205.08586."},{"key":"S0266466625000040_r24","unstructured":"Schlag, K. (2006). ELEVEN\u2014Tests needed for a recommendation. EUI working paper. ECO No. 2006\/2."},{"key":"S0266466625000040_r12","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.3982\/ECTA6630","article-title":"Asymptotics for statistical treatment rules","volume":"77","author":"Hirano","year":"2009","journal-title":"Econometrica"},{"key":"S0266466625000040_r4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729334"},{"key":"S0266466625000040_r5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4286-2"},{"key":"S0266466625000040_r23","unstructured":"Schlag, K. (2003). How to minimize maximum regret under repeated decision-making. EUI working paper."},{"key":"S0266466625000040_r30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jeconom.2011.06.013"},{"key":"S0266466625000040_r27","doi-asserted-by":"publisher","DOI":"10.1017\/S0266466607070089"},{"key":"S0266466625000040_r11","volume-title":"Nonparametric statistics and related topics","author":"Gupta","year":"1992"}],"container-title":["Econometric Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0266466625000040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T03:15:32Z","timestamp":1781147732000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0266466625000040\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,27]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["S0266466625000040"],"URL":"https:\/\/doi.org\/10.1017\/s0266466625000040","relation":{},"ISSN":["0266-4666","1469-4360"],"issn-type":[{"value":"0266-4666","type":"print"},{"value":"1469-4360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,27]]}}}