Browse Source

Make images visible

master
Lev 2 years ago
parent
commit
e1cd9f5ed3
  1. BIN
      flashloan_graph.png
  2. 57
      flashloan_graph.svg
  3. BIN
      loan_graph.png
  4. 512
      loan_graph.svg
  5. BIN
      main.pdf
  6. 27
      main.tex

BIN
flashloan_graph.png

Binary file not shown.

Before

Width:  |  Height:  |  Size: 241 KiB

After

Width:  |  Height:  |  Size: 263 KiB

57
flashloan_graph.svg

@ -9,9 +9,9 @@
sodipodi:docname="flashloan_graph.svg" sodipodi:docname="flashloan_graph.svg"
id="svg574" id="svg574"
version="1.1" version="1.1"
viewBox="0 0 92.600504 87.805092" viewBox="0 0 79.329439 87.805092"
height="87.805092mm" height="87.805092mm"
width="92.600502mm" width="79.329437mm"
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape" xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd" xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
xmlns="http://www.w3.org/2000/svg" xmlns="http://www.w3.org/2000/svg"
@ -28,15 +28,15 @@
inkscape:deskcolor="#d1d1d1" inkscape:deskcolor="#d1d1d1"
inkscape:document-units="mm" inkscape:document-units="mm"
showgrid="false" showgrid="false"
inkscape:zoom="1.3594764" inkscape:zoom="1.918622"
inkscape:cx="357.12279" inkscape:cx="240.53721"
inkscape:cy="214.42079" inkscape:cy="129.52004"
inkscape:window-width="1900" inkscape:window-width="1900"
inkscape:window-height="1010" inkscape:window-height="990"
inkscape:window-x="10" inkscape:window-x="10"
inkscape:window-y="60" inkscape:window-y="80"
inkscape:window-maximized="1" inkscape:window-maximized="1"
inkscape:current-layer="svg574" /> inkscape:current-layer="layer1" />
<defs <defs
id="defs571"> id="defs571">
<marker <marker
@ -226,27 +226,32 @@
ry="4.6899967" /> ry="4.6899967" />
<text <text
xml:space="preserve" xml:space="preserve"
style="font-size:3.52777px;line-height:1.25;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC';stroke-width:0.264583" style="font-size:3.88795px;line-height:1.25;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC';stroke-width:0.291597"
x="110.77233" x="110.77233"
y="206.77423" y="205.35179"
id="text3344"><tspan id="text3344"><tspan
sodipodi:role="line" sodipodi:role="line"
id="tspan3342" id="tspan3342"
style="stroke-width:0.264583" style="font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC Bold';stroke-width:0.291597"
x="110.77233" x="110.77233"
y="206.77423">Agorata invests</tspan><tspan y="205.35179">Agorata invests</tspan><tspan
sodipodi:role="line" sodipodi:role="line"
style="stroke-width:0.264583" style="font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC Bold';stroke-width:0.291597"
x="110.77233" x="110.77233"
y="211.18394" y="210.21173"
id="tspan3396">Smart contract returns</tspan><tspan id="tspan3396">Smart contract </tspan><tspan
sodipodi:role="line" sodipodi:role="line"
style="stroke-width:0.264583" style="font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC Bold';stroke-width:0.291597"
x="110.77233" x="110.77233"
y="215.59366" y="215.07167"
id="tspan3158"> returns</tspan><tspan
sodipodi:role="line"
style="font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;font-family:'Inconsolata LGC';-inkscape-font-specification:'Inconsolata LGC Bold';stroke-width:0.291597"
x="110.77233"
y="219.93161"
id="tspan3398">in the response message</tspan></text> id="tspan3398">in the response message</tspan></text>
<g <g
transform="matrix(0.45519,0,0,0.45519,144.00416,204.92024)" transform="matrix(0.65748153,0,0,0.65748153,148.02768,202.51831)"
ns8:version="1.6.0" ns8:version="1.6.0"
ns8:texconverter="pdflatex" ns8:texconverter="pdflatex"
ns8:pdfconverter="inkscape" ns8:pdfconverter="inkscape"
@ -286,7 +291,7 @@
</g> </g>
</g> </g>
<g <g
transform="matrix(0.45519,0,0,0.45519,158.43217,207.68699)" transform="matrix(0.50033718,0,0,0.50033718,142.92406,211.50224)"
ns8:version="1.6.0" ns8:version="1.6.0"
ns8:texconverter="pdflatex" ns8:texconverter="pdflatex"
ns8:pdfconverter="inkscape" ns8:pdfconverter="inkscape"
@ -451,15 +456,15 @@
</g> </g>
</g> </g>
<rect <rect
style="fill:#2ec27e;fill-opacity:1;stroke:none;stroke-width:1.20543;stroke-dasharray:none;stroke-opacity:1" style="fill:#26a269;fill-opacity:1;stroke:none;stroke-width:1.42535;stroke-dasharray:none;stroke-opacity:1"
id="rect5754" id="rect5754"
width="26.980967" width="31.903358"
height="10.665956" height="12.611846"
x="94.273643" x="91.812447"
y="167.79178" y="166.81883"
ry="3.0485003" /> ry="3.6046669" />
<g <g
transform="matrix(0.43574739,0,0,0.43574739,97.314997,171.33077)" transform="matrix(0.57084201,0,0,0.57084201,94.066202,170.72595)"
ns8:version="1.6.0" ns8:version="1.6.0"
ns8:texconverter="pdflatex" ns8:texconverter="pdflatex"
ns8:pdfconverter="inkscape" ns8:pdfconverter="inkscape"

Before

Width:  |  Height:  |  Size: 45 KiB

After

Width:  |  Height:  |  Size: 46 KiB

BIN
loan_graph.png

Binary file not shown.

Before

Width:  |  Height:  |  Size: 750 KiB

After

Width:  |  Height:  |  Size: 924 KiB

512
loan_graph.svg

File diff suppressed because it is too large Load Diff

Before

Width:  |  Height:  |  Size: 185 KiB

After

Width:  |  Height:  |  Size: 184 KiB

BIN
main.pdf

Binary file not shown.

27
main.tex

@ -30,6 +30,9 @@
\usepackage{authblk} \usepackage{authblk}
\usepackage{graphicx} \usepackage{graphicx}
\usepackage{svg}
\usepackage{caption}
\usepackage{subcaption}
\usepackage{fancyhdr} % Headers and footers \usepackage{fancyhdr} % Headers and footers
\pagestyle{fancy} % All pages have headers and footers \pagestyle{fancy} % All pages have headers and footers
@ -146,14 +149,34 @@ $$V(S_{i})>0 \vee \\ (\forall a_{ij} (V(S_{ij}) > 0 \vee a.s = A) \wedge a_{ij}:
The algorithm starts at the node $S_{0}$, then considers all the possible actions (including the abscence of one) and calls the algorithm at $S_{0i}$. If there is any action of the counteragent that makes the contract non-profitable for the agent, the deal is considered non-profitable. If there is no possible action and the state includes profit for the agent, the deal is considered acceptable. The algorithm starts at the node $S_{0}$, then considers all the possible actions (including the abscence of one) and calls the algorithm at $S_{0i}$. If there is any action of the counteragent that makes the contract non-profitable for the agent, the deal is considered non-profitable. If there is no possible action and the state includes profit for the agent, the deal is considered acceptable.
\subsection{Example} \subsection{Examples}
\begin{figure}[!htb]
\centering
\begin{subfigure}[b]{0.48\textwidth}
\centering
\includegraphics[width=\textwidth]{flashloan_graph.png}
\caption{Flashloan}
\end{subfigure}
\hfill
\begin{subfigure}[b]{0.48\textwidth}
\centering
\includegraphics[width=\textwidth]{loan_graph.png}
\caption{Loan}
\end{subfigure}
\caption{Graphs for some simple contracts}
\end{figure}
\section{Contract evaluation algorithm} \section{Contract evaluation algorithm}
In the previous section of the article we specified how the decisions are made. One of the most important parts of the process is finding out whether there exists any action that makes the deal profitable or unprofitable. It is also important to know which actions the agent should make to maximize its output. How do we do that? In the previous section of the article we specified how the decisions are made. One of the most important parts of the process is finding out whether there exists any action that makes the deal profitable or unprofitable. It is also important to know which actions the agent should make to maximize its output. How do we do that?
The state parameters are represented as functions of action parameters expressed in a formal language. The state parameters are represented as functions of action parameters expressed in a formal language. This allows to make all the decision based on mathematically proven algorithms.
\subsection{Building the formal tree}
\subsection{Considering the deal}
% Here it's about the path consideration algo + formal maximization + *template matching* % Here it's about the path consideration algo + formal maximization + *template matching*

Loading…
Cancel
Save