<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://openworld.existencia.org:80/index.php?action=history&amp;feed=atom&amp;title=Analysis_of_Leverage</id>
	<title>Analysis of Leverage - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://openworld.existencia.org:80/index.php?action=history&amp;feed=atom&amp;title=Analysis_of_Leverage"/>
	<link rel="alternate" type="text/html" href="http://openworld.existencia.org:80/index.php?title=Analysis_of_Leverage&amp;action=history"/>
	<updated>2026-04-21T17:04:46Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.0</generator>
	<entry>
		<id>http://openworld.existencia.org:80/index.php?title=Analysis_of_Leverage&amp;diff=34&amp;oldid=prev</id>
		<title>Jrising at 19:04, 29 February 2012</title>
		<link rel="alternate" type="text/html" href="http://openworld.existencia.org:80/index.php?title=Analysis_of_Leverage&amp;diff=34&amp;oldid=prev"/>
		<updated>2012-02-29T19:04:35Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Apply dynamic programming to the problem of&lt;br /&gt;
optimal control of policy levers within a complex system.  I don&amp;#039;t&lt;br /&gt;
think it&amp;#039;s inherently the most interesting topic or applies the most&lt;br /&gt;
material from class, but it serves my larger research projects.  I&amp;#039;m&lt;br /&gt;
not sure how far I can get analytically, and a lot of the work may&lt;br /&gt;
turn out to be numerical and heuristic, but this paper would be a&lt;br /&gt;
combination of some literature review, some analytic work, some&lt;br /&gt;
algorithms, and some simulations (maybe empirical results).&lt;br /&gt;
&lt;br /&gt;
The basic analytic setup is to assume that the state of a system in&lt;br /&gt;
time is some large set of functions, &amp;lt;math&amp;gt;{S_i(t)}&amp;lt;/math&amp;gt;.  The policy lever is&lt;br /&gt;
l(t), and can change the state variables by various functions, &amp;lt;math&amp;gt;\frac{dS_i}{dt}&lt;br /&gt;
= f_i({S_i(t)}, l(t))&amp;lt;/math&amp;gt;.  Then I can reinterpret the fundamental&lt;br /&gt;
optimization problem, max over &amp;lt;math&amp;gt;l(t)&amp;lt;/math&amp;gt; of integral of &amp;lt;math&amp;gt;u({S_i(t)}, l(t)) *&lt;br /&gt;
exp(-\delta t)&amp;lt;/math&amp;gt; into the high-dimensional dynamic programming problem,&lt;br /&gt;
&amp;lt;math&amp;gt;V({S_i}) = \max_{l_t} u({S_i}, l_t) + (1 / (1 + \delta)) * V({S_i&lt;br /&gt;
+ dt * f_i(l_t)})&amp;lt;/math&amp;gt;.&lt;/div&gt;</summary>
		<author><name>Jrising</name></author>
	</entry>
</feed>