<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Using a Model of Fraudulent Trader for Fraud Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Peter Fratrič</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sander Klous</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tom van Engers</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Informatics Institute, University of Amsterdam</institution>
          ,
          <country country="NL">the Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Leibniz Institute, TNO/University of Amsterdam</institution>
          ,
          <country country="NL">the Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The technological revolution brought by the internet, high performance computing, and artificial intelligence has fundamentally changed and continues to alter the landscape of finance. These innovations, if used with a malicious intent, can seriously destabilize the financial market. For this reason, countermeasures in the form of new detection methods are needed. In this study, we propose a novel detection framework that uses a model of fraudulent behavior to detect fraud from observed data. A similarity measure is defined to decide if the recorded actions of a monitored trader are matching actions of the fraudulent agent. We illustrate the framework on a simple form of manipulative trading in a simulation environment of a market consisting of two exchanges. This demonstrative case study is inspired by a price manipulation scheme that occurred on the Bitcoin market in 2017/18, where such simple forms of manipulation were observed. Simulation results outline vulnerabilities in markets, where uneven distribution of liquidity is present, as this can be exploited by pump-and-dump scheme.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Computational finance</kwd>
        <kwd>Fraud detection</kwd>
        <kwd>Pump-and-dump scheme</kwd>
        <kwd>Cryptocurrency</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Market fraud has been and continues to be a pressing issue of modern trading systems. Due
to relatively low number of observed instances and often high complexity of the fraudulent
behavior, the intrusion of the market is a challenging task to detect. Fraud can have wide
consequences on every socio-economical system. For instance, the issue of market manipulation
is especially present on cryptocurrency market [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and other relatively immature markets.
Although advances using statistical or modern machine learning solutions for the purpose of
monitoring the market behavior have been achieved [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], the question of accurate and
costefective market monitoring remains unsolved.
      </p>
      <p>In this study, we aim to address the question of detection on a more basic level. In principle,
every fraud is a manifestation of a behavioral scheme, and as such needs to be approached in
this way by considering a specific behavioral model. Agent-based simulations of economic
and social systems are gaining prominence in economy and finance. One might wonder if
agents designed to violate norms in these models could potentially be used to aid fraud analysts.
Moreover, to design suitable policies by accessing consequences of fraud on the market using
the simulation environment. Assuming availability of a model of a fraudulent entity, we focus
in this study on the research question of how can such a model be applied for fraud detection.</p>
      <sec id="sec-1-1">
        <title>1.1. Related research</title>
        <p>
          Financial fraud has been intensely studied through decades [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. In addition to tax evasion,
money laundering, or credit car fraud, the interest in study of market manipulation [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] has
increased due to the rise of pump-and-dump schemes on the cryptocurrency market [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. In the
area of fraud detection, models based on deep neural networks appear to be successful [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], as
they are able to model correlations in higher dimensions. Although the performance of these
models on certain validation datasets was relatively high, the issue of explainability and the
legal groundings of these models remains a significant drawback in wider applicability in the
socio-economic domain.
        </p>
        <p>
          Agent-based models appear to be a suitable tool for compliance modelling [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. In the economic
setting, agent-based models are more flexible compared to traditional mathematical models,
because they can model various nuanced psychological aspects of individual traders [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]. These
become relevant once an agent with the intent to take advantage of these aspects enters the
market. Application in the area of financial crime was limited to evaluation [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], or generation
of synthetic data [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Detection algorithms have been implemented as part of the agent-based
model [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], or in a distributed detection setting [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], but to our knowledge, no work has been
done in exploring how the model of a fraudulent agent can be used directly for detection of
fraudulent behavior.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2. Contribution</title>
        <p>The goal of this study is to illustrate how a model of a fraudulent agent can be used to detect
manipulative trading from an observed sequence of trading actions, and motivate further
research on agents learning noncompliant behavior from a simulation environment. We discuss
how this methodology can be integrated into current practice of market surveillance, assuming
that a model of a noncompliant agent is already available.</p>
        <p>
          The secondary contribution of this study is the implementation of a pump-and-dump market
manipulation scheme in a simulated market environment, that was observed on the Bitcoin
market in 2017/18 [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Recent agent-based analysis [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] suggested that the manipulation
scheme takes advantage of uneven distribution of liquidity, and the presence of trend-following
traders. We present new computational evidence that these two vulnerabilities of the Bitcoin
market significantly contributed to the success of the price manipulation eforts.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Simulation-detection framework</title>
      <p>Consider a socio-economic system where traders can exchange their assets, and there exists
a rule describing what type of behavior is considered malicious. This rule is not enforced
unless a detection method is present to identify noncompliant behavior. Assume a model of this
system calibrated to observed data to reproduce standard behavior of the real system. In this
system model, a parametric model of noncompliant agent is included, together with a similarity
measure that measures the similarity between the fraudulent agent and observed data of the
monitored trader. Depending on the similarity, the system monitoring authority can decide to
intervene.</p>
      <sec id="sec-2-1">
        <title>2.1. Class of noncompliant behaviors</title>
        <p>Let  denote the policy function of the fraudulent agent. The agent observes the current state
of the system, denoted by vector s. The state refers to publicly available variables, eg. public
information on a stock exchange, or possibly transactions on a blockchain.</p>
        <p>The model of the fraudulent agent will typically have a number of parameters  , that define
a subclass of fraud among the class of fraudulent behaviors, eg. a pump-and-dump scheme with
parameters defining the frequency or amount of purchased assets, a time threshold after which
the price is dumped etc. Note that these parameters are not coeficients of a statistical model, eg.
a Bayesian network, or a neural network. This means the   defines a class of noncompliant
behaviors parametrized with  , where for each choice  the behavior remains noncompliant.1</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Similarity score of fraudulent agent</title>
        <p>Let us consider a window of observations  , indexing the set of all states  = {s | ∈  } and
the set  that denotes the set of actions  taken by the monitored trader for  ∈  . The
similarity measure between  of the monitored trader and the fraudulent agent   for given
observed states of the system is defined as:
[,   | ] =
| | =1
1 ∑|︁| [ ,   (s )]
(1)
where  is a matching function between each action of the monitored trader and fraudulent
agent. This measure needs to be defined by (human) expert, and may depend on application
domain. We provide an example of the matching function later. For now, let us assume that
the function  is equal to 1 if the observed action of the monitored trader and the supposed
action of the fraudulent trader are exactly the same, and is equal to zero if they are as diferent
as possible. Note that the window expressed through  needs to be wide enough to include all
relevant evidence. If the fraudulent behavior is not entirely contained in the window, the score
still provides a valid indication of suspicious activities.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Inference</title>
        <p>
          The fraudulent agent observes the observable state of the system s at time . The policy function
  maps the observable state and the internal attributes of the agent into an action. Since  
defines a class of noncompliant behaviors, one would be interested to find such parameters

that maximize the probability that actions of some monitored trader correspond to the actions
of the fraudulent agent, ie. to localize the instance in the set {  | ∈ Θ} most similar to the
1Note that not all choices of  need to be profitable for the agent.
monitored trader, where Θ is a feasible region. In other words, we solve the optimization
problem
 * = arg max [,   | ]
 ∈Θ
(2)
Compared to standard statistical models, where likelihood function is of central importance,
what we gain by developing a causal model we loose during the inference process. Since
agent-based models do not necessarily come with a mathematical functional expression, the
inference needs to be performed without this assumption. The only assumption we make is the
possibility to sample (execute) the model. So-called likelihood-free methods were developed to
perform inference on simulation-based models [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. These methods typically require a similarity
measure between observed and generated data, and a prior distribution defined over the feasible
region Θ from which parameter values  are sampled.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Model-predictive intervention</title>
        <p>Once a solution to equation (2) is found, the (human) compliant analyst can decide to intervene
or not. This would be done by comparing the similarity measure (1) to a predefined intervention
threshold  . During the inference process, an implicit assumption is made that  is reasonably
close to a true model of considered fraudulent behavior. This assumption is highly relevant for
calibration of an intervention threshold for the market surveillance system, because a model of
noncompliance that produces high similarity score for every observed behavior would have too
high false positive rate. For this reason, every model needs to be validated on data generated in
the simulation model of the socio-economic system, or on observational data of the system.</p>
        <p>Performing monitoring of a trader can be done using the whole data history of the trader,
or in some predefined window. In our framework, with a model of fraudulent agent available,
it is possible to make rolling calculation of the score for the best estimated parameters. If the
fraudulent behavior is in progress, it is very common that there is insuficient evidence for
authorities to take action, ie. for an extended amount of time the behavior can be, although
suspicious, but still, fully compliant. For a realistic model of the fraudulent agent and correctly
defined similarity measure with calibrated intervention threshold value, it is desired that the
similarity score will be high for suspicious behavior and will surpass the threshold value only
after the fraudulent scheme is approaching its final steps. Ideally, right before the scheme
concludes is where it is needed to intervene. If a model of compliant behavior that is similar
to fraudulent behavior is available, then one can set  to be higher than the similarity score
produced by the compliant behavior, but is lower than the score of the fraudulent behavior.
This can prevent unfair interventions on individuals that are compliant, but only slightly difer
from fraudulent instances of a particular fraud scheme.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Modelling pump-and-dump scheme</title>
      <p>
        The prototypical example used to illustrate the proposed framework is based on a real event of
market manipulation that occurred on the Bitcoin market in 2017/18. This case was initially
analyzed in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], where clustering methods were used to identify relevant addresses, and
statistical methods were used to provide evidence that flow of cryptocurrency through these
addresses was highly correlated with price increase. The market manipulator had access to
virtually unlimited amount of Tether, a so-called stable coin supposedly backed by dollar, that
was issued by Tether limited and was used to create artificial demand on the Bitcoin market.
This case of market manipulation was in-depth investigated in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], where an order book market
model was developed with several simple trading agents, including a market manipulator agent.
Since Tether limited was bound to release audit statements proving that every issued Tether is
backed by one dollar, the manipulation scheme had to engage in massive selling at least once
per month, although evidence suggested that this liquidation process occurred roughly every
two months. This market behavior was likely even more impactful due to uneven distribution
of liquidity on various exchanges, so that the price pumping on a less liquid exchanger could
propagate through the whole system. Conversely, dumping the assets on a more liquid exchange
would result in a lower market impact.
      </p>
      <p>Taking the discussion above into consideration, we develop a model of an agent executing a
pump-and-dump scheme in a simulation model of a market. In order to test if uneven distribution
of liquidity plays a significant role, we consider a model of two exchanges, where one exchange
is less liquid. Since the illustrated methodology is independent of the Bitcoin market and can be
applied to any type of trading system, we will refrain from talking specifically about Bitcoins,
and will talk about the assets in general.</p>
      <sec id="sec-3-1">
        <title>3.1. Market model and response agents</title>
        <p>
          We consider a simple order book market model based on [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. An order book is a trading
mechanism with a bid side and an ask side that lists buy and sell orders, respectively. Each order
consists of limit price, asset amount to be bought or sold, and an expiration date. A trading day
 is discretized into  time steps during which each agent can issue a buy or sell order. Let us
denote by () the price of the traded asset and  the state of the order book at the time step .
In our model, two orders are matched in the order book if the limit price of the top buy order
is higher or equal to the limit price of the top sell order. The new asset price on the exchange
is then calculated as an average between the two limit prices. To extend the idea to a market
consisting of two exchanges, the market price () of the asset at time  is calculated as an
average weighted by daily traded volume of both exchanges () = 1()1()+2()2() , where
1()+2()
1(), 1() and 2(), 2() are daily volume-price pairs on exchange one and two, respectively.
        </p>
        <p>Two types of so-called response agents are trading in the simulation environment. These
agents are intended to model the response to the manipulation of the price. The simplest type of
agent is a Random agent. This agent issues a sell or buy order with equal probability every time
step on each exchange. At both exchanges  = 1, 2 the random agent calculates the limit price
as ( − 1) ·  ( ,  ) for sell orders and ((− ,1)) for buy orders, where ( − 1) is the market
price from previous time step. The asset amount is a random value drawn from an exponential
distribution with rate parameter   and the expiration time is drawn from a Poisson distribution
with parameter  . The values of all parameters are listed in Table 1. The second type of agent
trading on both exchanges is Chartist agent. This agent is active with 0.5 probability. Chartist
issues a buy order if the current price ( − 1) is higher than 7-day market price average and
sells otherwise. All other parameters are the same as for the random agent.</p>
        <p>Parameter values of these agents are listed in Table 1. Note that due to diferent values of
pair  1,  1 compared to pair  2,  2, there is lower agreement about the price of the asset on
the second exchange.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Fraudulent agent</title>
        <p>The observable state of the system is defined by a vector s() = (1(), 2(), 1(), 2(), ()),
where 1() and 2() are order books of exchanges one and two, respectively. The fraudulent
agent observes the state s() and makes a decision according to policy   . The function  
implements a simple trade-based pump-and-dump scheme that takes advantage of uneven
distribution of liquidity on exchanges. The agent performs a sequence of aggressive buy orders
such that the price impact due to low liquidity is maximized. At time ℎ the price of the asset is
dumped by a sequence of sell orders, but this time issued so that the price impact is minimized
by targeting the more liquid ask order book. Two attributes of the agent are the capital balance
() and the amount of assets () at time . The agent aims to execute a pump-and-dump
scheme such that the capital balance is positive and the amount of assets is zero.</p>
        <p>In more detail, the agent decides to issue a buy order before day ℎ with probability  .
The limit price, the amount of buy orders, and the expiration time is decided as in the case
of random agent. To choose which exchange to target, the fraudulent agent will estimate the
liquidity by calculating the immediate cost of buying or selling 10 units of its asset. If the agent
is buying, then the less liquid exchange is targeted. Conversely, the agent is selling on more
liquid exchange. The selling process is initiated after time threshold ℎ is reached. At each time
step a sell order is issued of  · () asset amount, where  is a random variable uniformly
distributed on the interval [0, ].</p>
        <p>In the simulation environment, parameters can be identified that make the manipulation
scheme profitable in given market conditions. Chosen parameters for the fraudulent agent
are listed in Table 1. An example of market price influenced by agent’s actions is shown on
Figure 1a.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Action matching function</title>
        <p>Consider a trader being monitored in the real market producing a sequence of trading actions.
The actions recorded into the set  have a form: (order type, exchange ID, asset
amount, limit price, expiration time). By inspecting   , it is easy to see that certain
parameters of the agent do not have to be estimated using likelihood-free inference. For example,
by having data of the monitored trader and known distributions used by the policy   the
information about the distribution of limit prices or expiration times can be obtained using
standard distribution estimation methods, thus we omit measuring similarity with respect to
these parameters.2</p>
        <p>Let  =   (s) be the action of the fraudulent agent given observable state s at time , then
we define:
• Order type match: (,  ) = 1 if the order types of the monitored trader and the
fraudulent agent are equal; zero otherwise.
• Exchange match: (,  ) = 1 if the exchange choice of the monitored trader and the
fraudulent agent are equal; zero otherwise.
• Amount distance: (,  ) = − (−  )2 for the asset amount components  and
 of  and  , respectively.</p>
        <p>Summing up the above quantities, the action matching measure is defined as (,  ) =
(,  )+(,  )+(,  ), where  = (, , ) are weights associated
with each summand. These weights can be used by the analyst if some patterns are suspected to
be more significant. The sequence of orders and selected exchanges provide more information
in our specific example, therefore we set the wight vector to  = (0.4, 0.4, 0.2).</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Inference using Approximate Bayesian Computation</title>
        <p>
          Approximate Bayesian Computation (ABC) [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] is a likelihood-free method capable to estimate
parameters of a model if the likelihood function is unknown. The main idea of ABC is based on
Bayes theorem  ( |) = ((|))  ( ) where the prior  ( ) is chosen by selecting a particular
distribution . Since the likelihood is not possible to evaluate, and we are only interested in
the relative posterior plausibilities of  , the normalizing constant  () can be also ignored.
All ABC methods approximate the likelihood by simulations that are compared to observed
data. The main premise of the method can be therefore expressed as  ( |) ≃   (, ^)( )
where ^ is a sample of considered parametric model. The model is executed for parameters
drawn from the prior distribution , and the simulation outcome is compared to observed data
using a distance measure  for a given acceptance threshold  .
        </p>
        <p>In our case, the observed data are  := . The simulated data are obtained by evaluation
  (s). The prior distribution  is defined over the feasible set Θ by the domain expert. Since the
similarity measure is defined to be equal to the (maximum) value one when the observed and
generated action are identical, we set  := 1 − [,   |]. As discussed in the previous
subsection, some parameters of the fraudulent agent are excluded from the likelihood free
inference, and therefore we let  = (ℎ, ,  ).</p>
        <p>We use the simplest form of ABC algorithm, which is the rejection sampler. To infer the
parameters of the fraudulent agent, the algorithm consists of four simple steps:
1. Sample  from prior distribution ( ).</p>
        <p>2. Simulate a dataset ^ using   ().
2We omit information about these parameters completely only for the sake of simplifying the example, since the
focus is on the likelihood free inference. In practice, the information should be included in the scoring function,
possibly with smaller impact depending on prior expectation of its significance.</p>
        <p>3. If (, ^|) &gt;  , accept  , and reject otherwise.</p>
        <p>4. Return to step 1 unless termination criterion is met.</p>
        <p>The termination of the algorithm is ensured by defining maximum number of iterations. At the
end of the sampling process, histograms of parameter values are generated.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>Applying inference to random, chartist, and fraudulent agent By solving (2) for each
agent, the parameters produced similarity scores much higher for the fraudulent agent than for
the random agent and the chartist agent. Therefore, the model can successfully diferentiate
between fraudulent and non-fraudulent agents, which provides baseline evidence that the model
and the similarity measure are correctly defined 3. In the case of the fraudulent agent, the ABC
algorithm converged for threshold  = 0.8 only in parameter ℎ, while the distributions of
parameters  and   stayed roughly uniform, which was confirmed by low p-values of
Kolmogorov-Smirnov test for uniformity. The parameters that did not converge for predefined
number of iterations suggest that the amount distribution parameter is not an important
component of the similarity measure, as was initially suspected.</p>
      <p>(a) Manipulated market price
(b) Similarity to pump-and-dump scheme</p>
      <p>Deciding the intervention threshold In general, assuming that we know what type of
compliant behavior is the most similar to the fraudulent agent, we can determine the threshold
values by computational experiment. Any pump-and-dump scheme has a minimum number of
3Clearly, in practice this testing would be done on real data of both compliant and fraudulent traders, but can be
also tested on various models of compliant agents to investigate which decision mechanisms tend to trigger false
positives.
days the price pumping process takes. Since the similarity measure (1) is an average over the
number of recorded actions, we can set without loss of generality ℎ = 55 days4.</p>
      <p>Consider a scenario where each day parameters of the monitored trader are estimated. Let
us set  to be the 95th percentile of the scoring distribution. On Figure 1b we can see the
average value of the similarity score calculated by sampling from the posterior. One can see
that the values of the score tend to be higher after the price dumping process starts on day 55.
Obviously, the intervention threshold  should be higher than the similarity score of an agent
that is unreasonably buying assets on less liquid exchange, which an example of a compliant
agent similar to the fraudulent agent. Once the monitored trader starts the price dumping
process, the threshold  should be low enough to identify the similarity as significant enough
to trigger a response from the authorities. This is why we set  = 0.89, as can be observed
on Figure 1b. Until day 54 the trader appears to be compliant, but on the 55th day the selling
process stars, which means pump-and-dump scheme ought to be detected. The red line is the
value of intervention threshold  . To prevent false alarms, the detection threshold is set slightly
higher than the score of the compliant behavior. Credible intervals give us information about
the certainty of observed fraudulent behavior. For instance, the monitored trader on day 54 has
slightly less than 50% chance to be fraudulent, but on 55th day the certainty is much higher.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>Design of agents capable to conduct a specific type of behavior in a real or simulated environment
is a central research question of artificial intelligence. In our study, we further motivate this
research by proposing a framework in which the model of a fraudulent agent can be used for
fraud detection. The proposed framework is illustrated on a market model where an agent
executing a simple pump-and-dump scheme is present. We use the agent to generate synthetic
data, and then to test the framework using the same model for detection. We also demonstrate
how the intervention threshold used by the market monitoring authorities can be decided by
considering similar but compliant sequences of actions. Moreover, our market model exemplifies
the vulnerability of markets where uneven distribution of liquidity is present on exchanges,
and provides additional evidence that this uneven distribution can be used to enhance
pumpand-dump schemes. Although this study was focused on trade-specific fraud, the proposed
methodology seems to be applicable to diferent areas. Abstraction of the methodology to
general norm learning agents along with the extension to coalition forming can be regarded as
future research directions.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was partly funded by the Dutch Research Council (NWO) for the HUMAINER AI
project (KIVI.2019.006).
4Value equal to 55 is roughly the same value the Bitcoin market manipulator have used in 2017/18 to sell enough
Bitcoins before the date of publishing the end of month audit statements.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Livshits</surname>
          </string-name>
          ,
          <article-title>The anatomy of a cryptocurrency pump-and-dump scheme</article-title>
          ,
          <source>in: 28th USENIX Security Symposium (USENIX Security 19)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1609</fpage>
          -
          <lpage>1625</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Nicholls</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kuppa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Le-Khac</surname>
          </string-name>
          ,
          <article-title>Financial cybercrime: A comprehensive survey of deep learning approaches to tackle the evolving financial crime landscape</article-title>
          ,
          <source>IEEE Access 9</source>
          (
          <year>2021</year>
          )
          <fpage>163965</fpage>
          -
          <lpage>163986</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Reurink</surname>
          </string-name>
          ,
          <article-title>Financial fraud: a literature review</article-title>
          ,
          <source>Journal of Economic Surveys</source>
          <volume>32</volume>
          (
          <year>2018</year>
          )
          <fpage>1292</fpage>
          -
          <lpage>1325</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Allen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gale</surname>
          </string-name>
          ,
          <article-title>Stock-price manipulation</article-title>
          ,
          <source>The Review of Financial Studies</source>
          <volume>5</volume>
          (
          <year>1992</year>
          )
          <fpage>503</fpage>
          -
          <lpage>529</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Victor</surname>
          </string-name>
          , T. Hagemann,
          <article-title>Cryptocurrency pump and dump schemes: Quantification and detection</article-title>
          , in: 2019
          <source>International Conference on Data Mining Workshops (ICDMW)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>244</fpage>
          -
          <lpage>251</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>E. van Asselt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Osinga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Bremmers</surname>
          </string-name>
          ,
          <article-title>Simulating compliance behaviour for efective inspection strategies using agent based modelling</article-title>
          ,
          <source>British Food Journal</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pilz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Cabrera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Brachten</surname>
          </string-name>
          , G. Neubaum,
          <string-name>
            <given-names>S.</given-names>
            <surname>Stieglitz</surname>
          </string-name>
          ,
          <article-title>Are social bots a real threat? an agent-based model of the spiral of silence to analyse the impact of manipulative actors in social networks</article-title>
          ,
          <source>European Journal of Information Systems</source>
          <volume>28</volume>
          (
          <year>2019</year>
          )
          <fpage>394</fpage>
          -
          <lpage>412</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raseta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bazarova</surname>
          </string-name>
          ,
          <article-title>Dynamics of phase transitions in expectations for ifnancial markets: An agent-based, multicomponent model</article-title>
          ,
          <source>Journal of Behavioral Finance</source>
          <volume>23</volume>
          (
          <year>2022</year>
          )
          <fpage>92</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Yagemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Uzun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ragam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Saltaformaggio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>On the feasibility of automating stock market manipulation</article-title>
          , in: Annual Computer Security Applications Conference, ACSAC '
          <fpage>20</fpage>
          , New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>277</fpage>
          -
          <lpage>290</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Lopez-Rojas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Axelsson</surname>
          </string-name>
          ,
          <article-title>A review of computer simulation for fraud detection research in financial datasets</article-title>
          ,
          <source>in: 2016 Future Technologies Conference (FTC)</source>
          , December, IEEE,
          <year>2016</year>
          , pp.
          <fpage>932</fpage>
          -
          <lpage>935</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Brito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Leite</surname>
          </string-name>
          ,
          <article-title>An agent-based model for detection in economic networks, in: Highlights of Practical Applications of Agents, Multi-Agent Systems</article-title>
          , and Complexity:
          <source>The PAAMS Collection</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Gowadia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Farkas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Valtorta</surname>
          </string-name>
          ,
          <article-title>Paid: A probabilistic agent-based intrusion detection system</article-title>
          ,
          <source>Computers &amp; Security</source>
          <volume>24</volume>
          (
          <year>2005</year>
          )
          <fpage>529</fpage>
          -
          <lpage>545</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>J. M. Grifin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Shams</surname>
          </string-name>
          , Is Bitcoin Really Untethered?,
          <source>Journal of Finance</source>
          <volume>75</volume>
          (
          <year>2020</year>
          )
          <fpage>1913</fpage>
          -
          <lpage>1964</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Fratrič</surname>
          </string-name>
          , G. Sileno,
          <string-name>
            <given-names>S.</given-names>
            <surname>Klous</surname>
          </string-name>
          , T. van Engers,
          <article-title>Manipulation of the Bitcoin market: an agent-based study</article-title>
          ,
          <source>Financial Innovation</source>
          <volume>8</volume>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F.</given-names>
            <surname>Hartig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Calabrese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Reineking</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wiegand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Huth</surname>
          </string-name>
          ,
          <article-title>Statistical inference for stochastic simulation models-theory and application</article-title>
          ,
          <source>Ecology letters 14</source>
          (
          <year>2011</year>
          )
          <fpage>816</fpage>
          -
          <lpage>827</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Marchesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cincotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Focardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raberto</surname>
          </string-name>
          ,
          <article-title>The genoa artificial stock market: Microstructure and simulations</article-title>
          , in: Heterogenous Agents,
          <source>Interactions and Economic Performance</source>
          , Springer,
          <year>2003</year>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>289</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sunnåker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Busetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Numminen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Corander</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Foll</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dessimoz</surname>
          </string-name>
          , Approximate Bayesian Computation,
          <source>PLoS Computational Biology</source>
          <volume>9</volume>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>