{"id":14660,"date":"2022-05-20T20:06:17","date_gmt":"2022-05-21T00:06:17","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=14660"},"modified":"2026-06-09T14:42:27","modified_gmt":"2026-06-09T18:42:27","slug":"tr-32-multi-action-learning-automata-possessing-ergodicity","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1983\/tr-32-multi-action-learning-automata-possessing-ergodicity\/","title":{"rendered":"TR-32: Multi-Action Learning Automata Possessing Ergodicity of the Mean"},"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-32: Multi-Action Learning Automata Possessing Ergodicity of the Mean\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1983\/\">Technical Report<\/a>\u00a0<strong>TR-32<\/strong><br>August 1983<\/p>\n\n\n\n<h2 id=\"multi-action-learning-automata-possessing-ergodicity-of-the-mean\" class=\"wp-block-heading\">Multi-Action Learning Automata Possessing Ergodicity of the Mean<\/h2>\n\n\n\n<p>B.J. Oommen &amp; M.A.L. Thathachar<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>Multi-action learning automata which update their action probabilities on the basis of the responses they get from an environment are considered in this paper. The automata update the probabilities whether the environment responds with a reward or a penalty. Learning automata are said to possess Ergodicity of the Mean (EM) if the mean action probability is the state probability (or unconditional probability) of an ergodic Markov chain. The only known algorithm which is Ergodic in the Mean (EM) is the Symmetric Linear Reward-Penalty (LRP) scheme. Earlier [ 11] necessary and sufficient conditions have been derived for two-action nonlinear updating schemes to be Ergodic in the mean (FM).<\/p>\n\n\n\n<h3 id=\"download\" class=\"wp-block-heading\">Download<\/h3>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-32.pdf\">TR-32.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report\u00a0TR-32August 1983 Multi-Action Learning Automata Possessing Ergodicity of the Mean B.J. Oommen &amp; M.A.L. Thathachar Abstract Multi-action learning automata which update their action probabilities on the basis of the responses they get from an environment are considered in this paper. The automata update the probabilities whether the environment responds with a reward or [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11785,"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-14660","page","type-page","status-publish","hentry","cu_page_type-technical-report"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14660","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=14660"}],"version-history":[{"count":4,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14660\/revisions"}],"predecessor-version":[{"id":24570,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14660\/revisions\/24570"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11785"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=14660"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=14660"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}