{"id":12586,"date":"2021-11-13T16:58:57","date_gmt":"2021-11-13T21:58:57","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12586"},"modified":"2026-06-02T14:59:26","modified_gmt":"2026-06-02T18:59:26","slug":"tr-74-absorbing-and-ergodic-discretized-two-action-learning-automata","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1985\/tr-74-absorbing-and-ergodic-discretized-two-action-learning-automata\/","title":{"rendered":"TR-74: Absorbing and Ergodic Discretized Two Action Learning Automata"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-74: Absorbing and Ergodic Discretized Two Action Learning Automata\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n<p>Carleton University<br>\n<a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1985\/\">Technical Report<\/a> <strong>TR-74<\/strong><br>\nMay 1985<\/p>\n\n\n\n<h2 id=\"absorbing-and-ergodic-discretized-two-action-learning-automata\" class=\"wp-block-heading tr_t1\">Absorbing and Ergodic Discretized Two Action Learning Automata<\/h2>\n\n\n\n<div class=\"tr_t3\">John Oommen<\/div>\n\n\n\n<div>\n<h3>Abstract<\/h3>\n<p>A learning automata is a machine that interacts with a random environment and which simultaneously learns the optimal action which the environment offers to it. Ih this paper we consider learning automata which have a variable structure. Such automata are completely defined by a set<br>\nof probability updating rules [4,9,20]. All the Variable Structure Stochastic Automata (VSSA) discussed in the literature, update the probabilities in such a way that an action probability can take any real value in the interval [0,1]. As opposed to these, in this paper we shall discretize the probability space so as to permit the action probability<br>\nto assume one of a finite number of distinct values in [O,l]. The discretized automaton is termed linear or nonlinear depending on whether or not the<br>\nsub-intervals of [O,l] are of equal length. We shall prove that:<br>\n(1) Discretized Two-Action Linear Reward-Inaction Automata are<\/p>\n<p>absorbing and \u00a3-optimal in all environments.<\/p>\n<p>(2) Discretized Two-Action Linear Inaction-Penalty Automata are<\/p>\n<p>ergodic and expedient in all environments.<\/p>\n<\/div>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-74.pdf\">TR-74.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-74 May 1985 Absorbing and Ergodic Discretized Two Action Learning Automata John Oommen Abstract A learning automata is a machine that interacts with a random environment and which simultaneously learns the optimal action which the environment offers to it. Ih this paper we consider learning automata which have a variable structure. [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11823,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[88],"class_list":["post-12586","page","type-page","status-publish","hentry","cu_page_type-technical-report"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12586","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12586"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12586\/revisions"}],"predecessor-version":[{"id":12600,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12586\/revisions\/12600"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11823"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12586"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12586"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}