A dynamic programming approach to the efficient design of clinical trials

被引:53
|
作者
Claxton, K [1 ]
Thompson, KM
机构
[1] Univ York, Dept Econ, York YO1 5DD, N Yorkshire, England
[2] Harvard Univ, Sch Publ Hlth, Boston, MA 02115 USA
关键词
Bayesian decision theory; value of information; clinical trials; stochastic CEA;
D O I
10.1016/S0167-6296(01)00093-5
中图分类号
F [经济];
学科分类号
02 ;
摘要
If the prospective evaluation of all feasible strategies of patient management is not possible or efficient then this poses a number of questions: (i) which clinical decision problems will be worth evaluating through prospective clinical research; (ii) if a clinical decision problem is worth evaluating which of the many competing alter-natives should be considered "relevant" and be compared in the evaluation; (iii) what is the optimal (technically efficient) scale of this prospective research; (iv) what is an optimal allocation of trial entrants between the competing alternatives; and (v) what is the value of this proposed research? The purpose of this paper is to present a Bayesian decision theoretic approach to the value of information which can provide answers to each of these questions. An analysis of the value of sample information was combined with dynamic programming and applied to numerical examples of sequential decision problems. The analysis demonstrates that this approach can be used to establish: optimal sample size; optimal sample allocation; and the societal payoff to proposed research. This approach provides a consistent way to identify which of the competing alternatives can be regarded as "relevant" and should be included in any evaluative study design. Bayesian decision theory can provide a general methodological framework that can ensure consistency in decision making between service provision, research and development, and the design, conduct and interpretation clinical research. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:797 / 822
页数:26
相关论文
共 50 条
  • [41] Canal design by dynamic programming
    Radovic, G
    JOURNAL OF IRRIGATION AND DRAINAGE ENGINEERING-ASCE, 1996, 122 (01): : 59 - 63
  • [42] A Dynamic Constraint Programming Approach
    Monfroy, Eric
    Castro, Carlos
    Crawford, Broderick
    CUTTING-EDGE RESEARCH TOPICS ON MULTIPLE CRITERIA DECISION MAKING, PROCEEDINGS, 2009, 35 : 653 - +
  • [43] A Consensus Approach to Dynamic Programming
    Laurini, Mattia
    Consolini, Luca
    Locatelli, Marco
    IFAC PAPERSONLINE, 2017, 50 (01): : 8435 - 8440
  • [44] Energy-Efficient Subway Train Scheduling Design With Time-Dependent Demand Based on an Approximate Dynamic Programming Approach
    Liu, Renming
    Li, Shukai
    Yang, Lixing
    Yin, Jiateng
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (07): : 2475 - 2490
  • [45] Dynamic programming as frame for efficient parsing
    Ferro, MV
    Souto, DC
    Pardo, MAA
    SCCC'98 - XVIII INTERNATIONAL CONFERENCE OF THE CHILEAN SOCIETY OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 68 - 75
  • [46] Designing lean, efficient clinical trials is an ethical imperative: the fragility index should not be used in the design of randomized clinical trials
    Stensland, Kristian D.
    Daignault-Newton, Stephanie
    Skolarus, Ted A.
    UROLOGIC ONCOLOGY-SEMINARS AND ORIGINAL INVESTIGATIONS, 2021, 39 (10) : 738 - 739
  • [47] Design of Clinical Trials
    Rollo, David
    Machado, Sanjay
    Ceschin, Mauro
    SEMINARS IN NUCLEAR MEDICINE, 2010, 40 (05) : 332 - 337
  • [48] A Novel and Efficient Mathematical Programming Approach for the Optimal Design of Rainwater Drainage Networks
    Sene, Ana Paula
    Caballero, Jose A.
    Ravagnani, Mauro A. S. S.
    WATER RESOURCES MANAGEMENT, 2025, 39 (02) : 883 - 905
  • [49] OPTIMUM DESIGN OF TRANSFORMER CORE CROSS-SECTION - DYNAMIC PROGRAMMING APPROACH
    BHUSHAN, P
    GEHLOT, NS
    IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1972, PA91 (04): : 1725 - &
  • [50] DYNAMIC PROGRAMMING APPROACH TO OPTIMAL FEEDBACK-FEED-FORWARD CONTROLLER DESIGN
    WEST, HH
    MCGUIRE, ML
    JOURNAL OF ENGINEERING MATHEMATICS, 1970, 4 (03) : 187 - &