Few more lines in report.
This commit is contained in:
parent
30c374cf1a
commit
1dcdeaaac2
1 changed files with 37 additions and 2 deletions
39
report.tex
39
report.tex
|
@ -7,11 +7,13 @@
|
|||
\usepackage{graphicx}
|
||||
\usepackage{indentfirst}
|
||||
\usepackage{enumerate}
|
||||
\usepackage{cite}
|
||||
\usepackage[left=2cm,right=2cm,top=2cm,bottom=2cm]{geometry}
|
||||
|
||||
% Custom packages
|
||||
\usepackage{leftrule_theorems}
|
||||
\usepackage{concurgames}
|
||||
\usepackage{symbols}
|
||||
\usepackage{my_listings}
|
||||
\usepackage{my_hyperref}
|
||||
\usepackage{math}
|
||||
|
@ -29,6 +31,8 @@
|
|||
|
||||
\todo{abstract}
|
||||
|
||||
\tableofcontents
|
||||
|
||||
\section{Existing work}
|
||||
|
||||
My work is set in the context of a wider theory, the basics of which are
|
||||
|
@ -44,7 +48,8 @@ Opponent plays $B$, thus reaching the configuration $A \cdot B$'').
|
|||
\subsection{Event structures}
|
||||
|
||||
\begin{definition}[event structure]
|
||||
An \emph{event structure} is a pair $(E, \leq_E, \con_E)$, where $E$ is a
|
||||
An \emph{event structure}~\cite{winskel1986event} is a pair
|
||||
$(E, \leq_E, \con_E)$, where $E$ is a
|
||||
set of \emph{events}, $\leq_E$ is a partial order on $E$ and
|
||||
$\con_E \subseteq \powerset(E)$ is a set of \emph{consistent events}.
|
||||
|
||||
|
@ -128,7 +133,37 @@ play one of its moves, while~(\ref{def:courteous}) states that unless a
|
|||
dependency relation is imposed by the games' rules, one can only make one of
|
||||
its moves depend on an Opponent move.
|
||||
|
||||
\section{Implementation of non-concurrent games}
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
|
||||
\section{Implementation of deterministic concurrent games}
|
||||
|
||||
\hfill\githubrep[Github repository]{https://github.com/tobast/cam-strategies/}
|
||||
|
||||
\vspace{1em}
|
||||
|
||||
The first part of my internship mostly consisted --- apart from understanding
|
||||
the bibliography and the underlying concepts --- in the implementation of
|
||||
operations on \emph{deterministic} concurrent games, that is, concurrent games
|
||||
as event structures without conflicts. The work had to be done from scratch, as
|
||||
no one implemented this before.
|
||||
|
||||
This implementation aims to provide
|
||||
\begin{enumerate}[(i)]
|
||||
\item a --- more or less --- convenient way to input games/strategies;
|
||||
\item basic operations over those games and strategies: parallel
|
||||
composition, pullback, interaction, composition, copycat, \ldots;
|
||||
\item a clean display as a Dot graph.
|
||||
\end{enumerate}
|
||||
|
||||
\subsection{Structures}
|
||||
|
||||
The implementation aims to stay as close as possible to the mathematical model,
|
||||
while still providing quite efficient operations.
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
|
||||
\bibliography{biblio}
|
||||
\bibliographystyle{alpha}
|
||||
|
||||
\end{document}
|
||||
|
||||
|
|
Loading…
Reference in a new issue