Abstract
Abstract Two adaptive control techniques are compared in the context of an adaptive reinvestment two-armed bandit problem. The first solution technique is the Bayesian-dynamic programming approach. The distinctive feature of the recently proposed second solution technique is the direct estimation and updating of the criterion function without recourse to explicit probability distribution estimation via Bayes's rule. The control selections generated by the two solution techniques are shown to closely approximate each other. An explanation for this close correspondence is provided by means of an equivalence theorem for control objective specification.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
