<!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>Towards Context-Aware, Real Time and Autonomous Decision Making Using Information Aggregation and Network Analytics</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Prithiviraj Dasgupta</string-name>
          <email>pdasgupta@unomaha.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sanjukta Bhowmick</string-name>
          <email>sbhowmick@unomaha.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Nebraska at Omaha Omaha</institution>
          ,
          <addr-line>Nebraska, 68182-0500</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>6</fpage>
      <lpage>9</lpage>
      <abstract>
        <p>-We consider the problem of real-time, proactive decision making for dynamic and time-critical decision-events where the choices made for multiple, individual decisions over time determine the final decision outcome of an event. We posit that the quality of such individual decisions can be significantly improved if human decision makers are provided with decision aids in the form of dynamically updated information and dependencies between the different decision variables, and the humans affecting those decision variables. In this position paper, we propose the CONRAD (CONtext aware Real-time Adaptive Decision making) system that uses computational techniques from large scale network analysis and game theory-based distributed information aggregation to develop such decision aids. CONRAD's functionalities are implemented through three subsystems - a decision making subsystem that updates and mathematically combines information from different decision variables to predict the outcome of the decision event, a decision assessment subsystem that uses the currently predicted decision outcome to estimate the future decision trajectory and recommends information collection-related actions to the human decision maker, and, a network analysis subsystem that uses those recommended actions to dynamically update the dependencies and correlations between events and people influencing the decision variables. To the best of our knowledge, our work is one of the first attempts towards combining dynamic decision updates and using the predicted decision trajectory as a proactive feedback mechanism to dynamically update the correlations between decision variables so that human decision makers can make more strategicallyinformed and well-aligned decisions towards the desired outcome of decision events.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>I. INTRODUCTION</p>
      <p>
        Modern decision making scenarios are characterized by
large amounts of data and information that arrive dynamically,
over a short period of time, from multiple sources. Processing
this data in a time-critical manner to make accurate decisions
is an overwhelming task for human decision makers. Over
the past few decades several decision making solutions have
been proposed to aid human decision makers with tools such
as intelligent or automated software that use computational
methods and mathematical models of human cognitive
processes to make sophisticated decisions on behalf of humans[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. However, most existing decision support tools provide
only limited context awareness of the decision process to the
decision maker in rapidly evolving, information-rich and
timecritical scenarios. This reduces the efficiency of human
decision makers in making accurate decisions, and, consequently,
could result in erroneous decision making in critical situations.
Therefore, it makes sense to investigate techniques that could
alleviate the human decision makers’ context awareness by
presenting information relevant to the decision making process,
precisely and in a timely manner, to the decision maker.
      </p>
      <p>To address this problem, we present the framework of
a context-aware, real-time, decision making system called
the CONRAD (CONtext aware Real-time Adaptive Decision
making) system that focuses on enabling and enhancing the
capabilities of human decision makers by developing proactive
decision-aids for making high-accuracy, time-critical decisions
in complex, data- and information-rich environments. The
central research problem that CONRAD proposes to answer
is as follows: Given a set of decision variables in the current
decision context along with a set of data sources from which
the decision variables can be derived and/or calculated and
updated, what is a suitable set of techniques for (i) extracting
relevant information, (ii) then using that information to update,
correlate and aggregate the decision variables dynamically,
and finally , (iii) assessing the quality of the aggregated
decision outcome (prediction), so that the divergence between
the aggregated decision outcome (predictions) and the desired
decision outcome is successively minimized?</p>
      <p>To address this question, we propose to represent a decision
event as a collection of decision variables that are affected by
the data from the environment. The system dynamically
determines the inter-dependencies between these decision variables
and also periodically updates them into an aggregated decision
outcome (prediction). This aggregated decision outcome is
then evaluated with respect to the desired decision outcome,
and, depending on the deviation between the actual and
desired decision outcomes, actions are recommended to collect
additional data/information and discover new data correlations.
This information is then used to update the decision variables
autonomously and proactively - so that the quality of the
aggregated decision outcome successively converges towards
the desired outcome. We plan to realize the aforementioned
functionalities in CONRAD using three subsytems that are
summarized below:
(1) Decision Making Subsystem: The decision making
subsystem uses a prediction market-based information aggregation
mechanism to update and mathematically combine or
aggredec1
dec2</p>
      <p>Sliding</p>
      <p>Autonomy
Goal-directed Decision
Making Component
Updates and aggregates
decision variables, predicts
decision outcome</p>
      <p>Pred.</p>
      <p>Dec.</p>
      <p>Out-come</p>
      <p>Update dec. vars with new
informa!on and new correla!ons</p>
      <p>Past/Similar
Decisions
Decision Assessment</p>
      <p>Component
Calculates devia!on of
predicted and desired
decision outcomes, suggests
ac!ons based on relevance
to domain/past decisions</p>
      <p>Devia!on,
Sugg.
ac!on</p>
      <p>Dynamic Info
Extrac!on &amp;
Valua!on</p>
      <p>Component
Iden!fies cri!cal/info.
deficient dec. vars,
extracts targeted new
info, discovers new
info correla!ons, etc.
gate information from different decision variables and predict
the outcome of the decision event.
(2) Decision Assessment Subsystem: The decision assessment
subsystem uses the currently predicted decision outcome from
the decision making subsystem along with relevant domain
knowledge from past decisions made in similar domains to
predict the decision trajectory and recommends information
collection-related actions to the human decision maker.
Machine learning and AI-based planning techniques are used
to implement the functionalities of the decision assessment
subsystem.
(3) Dynamic Information Extraction and Valuation Subsystem:
The dynamic information extraction and valuation subsystem
uses the actions recommended by the decision assessment
subsystem to model and dynamically update the dependencies
and correlations between events and people that influence the
decision variables using metrics and techniques from large
scale network analysis. The different components of CONRAD
and their main functionalities are given in Figure 1 and
discussed in the following sections.</p>
      <p>
        The main research question addressed in CONRAD’s goal
directed decision making subsystem is how to design a suitable
set of computation techniques to dynamically update the
different decision variables in the current decision context and
combine or aggregate them into a single, global decision outcome.
The decision variables are extracted from the environment’s
information by CONRAD’s information extraction component,
discussed in Section IV. We propose to perform the update
and aggregation of the individual decision variables using
an information aggregation technique inspired by prediction
markets. Prediction market based information aggregation [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
has been recently shown to be a reasonably accurate means
of predicting the outcome (usually binary or discrete valued
outcome) of an event that is going to happen in the future. In
our previous research, we have developed several successful
techniques for multi-agent based prediction markets [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] where the market’s trading operations are performed by
automated software agents. In prediction markets, information
is collected from people, news sources, etc. in the form of bids,
using either virtual or real money, on the possible outcome
(binary-valued) of a future event. These bids are aggregated
and the aggregated value represents the people’s prediction of
the event’s outcome. A schematic of CONRAD’s goal-directed
decision making component is shown in Figure 2. To explain
our approach, we use a few mathematical notions - let {decit}
denote the set of individual decision variables of the current
decision making context at time step t, AggDect denote the
aggregated decision from aggregating {decit} at time step t,
where decit, AggDect ∈ [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ]. With this formulation, each
decit can be interpreted as a probabilistic confidence or belief
of the decision variable; likewise for AggDect.
      </p>
      <p>Dynamic decision variable updates. To enable dynamic
updates of the decision variables, we associate each decit with
a decision making (or belief update) agent ai; ai is responsible
for updating the value of decit at time step t. Agent ai performs
this update using the following belief update formula:
decit = beli(decit−1, dect−−i1, AggDect−1),
where beli(.) is the belief update function used by agent i,
decit−1 is the value of deci during time step t−1, dect−−i1 is the
set of decision variables from time step t−1, excluding decit−1
itself, that are correlated with decit during time step t and
AggDect−1 is the value of the aggregated decision outcome
during time step t − 1. The decision maker agent also ensures
that decision variables that have already converged to their
optimal or best value are not updated. The decision maker
agent uses the intelligence, from reviewing the current context,
to identify only those decision variables that need updating.</p>
      <p>
        Aggregating decision variables. At the next step, the
individual decision variables are combined into an aggregate
or predicted decision outcome by the aggregator agent. A
market-based aggregation mechanism provides a suitable way
to combine information from multiple sources (e.g., multiple
decision variables updated by the decision maker agents) into
a single aggregated decision outcome value using a technique
called a scoring rule [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>III.</p>
      <p>DECISION ASSESSMENT</p>
      <p>The objective of CONRAD’s decision assessment
component is to determine how well the current aggregated
(predicted) decision outcome is aligned with the desired decision
outcome and to recommend actions related to future
information collections that could potentially improve the convergence
of the predicted decision outcome towards the decision
outcome. A schematic of the decision assessment component is
shown in Figure 3. Because we have represented decision
outcomes as probability distributions (belief values), statistical
divergence metrics such as the Kullback-Leibler (KL) divergence
can be used to predict the future decision trajectory - Some
Decision
Variables
&amp;
Correla!ons
deci t-1
:
…
Decision
!me
deci t
:
.</p>
      <p>:
Updated
Decision
Vars.</p>
      <p>…
Informa!on
Aggregator</p>
      <p>Agent
Aggrega!on
Mechanism
Dec. Agent
Scoring
(Payment)</p>
      <p>Rule
…</p>
      <p>Agent Rewards/Penal!es</p>
      <p>
        Predic!on Market-based Mechanism for Informa!on Aggrega!on
well-known decision trajectories can be constructed from past
decisions and then Bayesian inference can be used to classify
the current decision trajectory into one of the trajectory types.
The historical aggregated decisions can be further refined
with domain knowledge to reflect the changes in the situation
since the decisions were aggregated. The decision assessment
subsystem also suggests actions related to future information
collection to the human decision maker and to CONRAD’s
information extraction/evaluation component using AI-based
planning techniques such as MDPs and POMDPs [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The
outcome of the action recommendation algorithm would be
a probabilistic distribution over recommended actions from
which an action can be picked strategically by CONRAD’s
Information Extraction and Valuation component.
      </p>
      <p>INFORMATION EXTRACTION AND VALUATION</p>
      <p>The key to efficient decision making is to ensure that the
available information is dynamically updated and important
correlations in data are accurately captured. To achieve these
objectives, CONRAD will perform the following operations in
real time;</p>
      <p>
        Extract Decision Variables from Raw Data. The data
extraction tool of CONRAD extracts data from different
heterogeneous and potentially changing sources and filters
decision variables - id of the data creator, the data creation
time, and a list of key fields such as demography, topic
of discussion, etc. We will use Semantic Technology and
represent the list of fields through an ontology based language
such as OWL. Our goal is to create a database similar to
DBpedia (dbpedia.org/About) that will allow users to submit
queries with multiple conditions and identify entities that fulfill
those queries. The correlations between the decision variables
are modelled as networks (or graphs). The vertices in the
network represent the entities and the edges represent the
correlations. Using this collected data, the information
component performs the following subtasks: (a) Creating Multilevel
Networks. A network is created from the processed data as
follows - one field in the dataset is identified as the entity
variable and other selected field(s) as the relation variable(s).
Each vertex of the network represents a unique instance of
the entity variable (here each entry is the name) and two
entities are connected if they satisfy certain relations between
the relation variables (for example, ids with age difference of
five years or less are connected). The connectivity patterns
of the networks can with the time stamp changes. Networks
based on the same entity variable can be further combined
to a multilevel network. This enables us to unearth obscure
information that is not immediately relevant from only one
database. (b) Real Time Analysis of Networks. The analysis of
the networks provides insights to the characteristics of the data.
Some of the common analysis objectives in CONRAD include
(i) detecting communities to identify tightly connected groups
of vertices [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and (ii) computing centrality metrics, core
numbers and driver nodes to determine the influential people
(or data) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We plan to extend these analysis by including
the semantics of the networks. The edges in the network will
be annotated by their semantic values (i.e. age, demography,
etc). We can therefore refine communities obtained from the
initial vertex based method combining entities that have similar
semantic values in their links.
      </p>
      <p>
        CONRAD performs network analysis operations at three
levels, as illustrated in Figure 4. The first is the horizontal
level that analyzes each entity network. The second is the
longitudinal level where the analysis is conducted across levels
(the networks at each level have the same entity variable,
but the relational variable(s) and therefore the structure is
different). The third level is the temporal level where we
track the changes to the network structure across different
time steps [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. CONRAD will implement parallel algorithms
and approximate methods to perform the analysis in real
time [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]). The information network is connected to the
decision variables by matching the component networks, each
representing a decision variable to the appropriate decision
making agent. For example, if the agent’s decision is to deliver
supplies to disaster stricken areas, then the agent has to obtain
information from networks whose entity variable is the location
as well as from the network whose entity variable is the
demography.
      </p>
      <p>
        Identifying Critical Decision Variables. Identify
important decision variables that can predict future events will
enable users to maintain the correct decision trajectory. The
critical variables are the ones whose corresponding networks
guarantee that the analysis results are accurate under various
perturbations to the data and are sensitive to changes in the
data. CONRAD evaluates the reliability of the network models
based on well-posedness and the sensitivity with respect to the
analysis objective. To the best of our knowledge, our work
is one of the first instances that a network analysis toolkit
will include a component to compute the accuracy of the
data. Well-posedness is a measure of whether the analysis
objective, is feasible for a given network. To compute
wellposedness of a network, CONRAD computes the number of
solutions that the network has for a given analysis function.
For community detection, this can be computed by changing
the vertex ordering, and then taking the consensus of the
communities obtained at each ordering to find the well-posed
subgraph [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This computation can be extended to the
overlapping communities as well. For centrality metrics and
core numbers, we are interested in only the high valued ones.
To determine whether a network is well-posed, the centrality
values for each vertex is first evaluated and then the size of
the set of ’high-valued’ vertices is checked. If this set is very
large, then none of the vertices will be distinctively important.
Sensitivity measures whether a small change to the input
produces a commensurate change in the results. To compute
the sensitivity of network analysis, CONRAD uses models of
small perturbations (or noise) to the network and metrics to
evaluate this noise [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. After evaluating all the networks based
on these well-posedness and sensitivity, the system will retain
only the ones that produce accurate results and are sensitive
to changes in data. The entity and relation variables of these
networks are the critical variables and will produce reliable
data patterns that can be used for prediction.
      </p>
      <p>Integrating Decision Making and Data Extraction. The
final objective of the information extraction and valuation
component in CONRAD is to use the recommendations from
the decision assessment algorithm to update the information
networks. Based on the recommended actions, the information
component tries to extract ’meaningful information’ from ’raw
data’. The main operations of this process are (i) improving
the data gathering mechanism, (ii) improving the quality of the
networks and (iii) improving accuracy of the analysis.
Data Gathering. The data gathering operation can be improved
by adding more varied sources of information. For example, we
can enrich information about possible disasters, by including
information of past hurricanes and earthquakes, in addition to
tracking the current disaster through news sources, and social
network sites.</p>
      <p>
        Adaptive Refining of Data Data is generally gathered
’wholesale’, without specifically considering the subsequent use of
the information. In the network modeling stage, the system
refines the data by filtering the initial network based on certain
combinatorial properties. For example if the agents’ focus is on
finding clusters of similar entities, then a chordal graph based
filtering that will retain only the tightly connected components
in the network is used. Conversely if the decisions are to be
based on centrality metrics, then filtering to reduce the low
weight edges is more effective [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>V.</p>
      <p>CONCLUSION</p>
      <p>In this position paper, we have proposed CONRAD, a
realtime, proactive decision aiding tool that leverages the
advantages of game theory, machine learning and network analysis.
Each of the individual components proposed for CONRAD
have been shown to be successful in their respective domains
and we posit that combining them will further enhance the
decision making capabilities.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kintali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Madduri</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Mihail</surname>
          </string-name>
          .
          <source>Approximating Betweenness Centrality. The 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007)</source>
          ,
          <volume>4863</volume>
          ,
          <fpage>134</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhowmick</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Paymal</surname>
          </string-name>
          .
          <article-title>Fast Community Detection For Dynamic Complex Networks</article-title>
          .
          <source>Communications in Computer and Information Science</source>
          Vol.
          <volume>116</volume>
          ,
          <fpage>196</fpage>
          -
          <lpage>207</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Burstein</surname>
          </string-name>
          and C. Holsapple (editors),
          <source>”Handbook on Decision Support Systems</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Basic</surname>
            <given-names>Themes</given-names>
          </string-name>
          ,”,
          <source>International Handbooks on Information Systems</source>
          , Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chakrabory</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Srinivasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhowmick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mukherjee</surname>
          </string-name>
          .
          <article-title>Constant Communities in Complex Networks</article-title>
          .
          <source>Nature Scientific Reports</source>
          <volume>3</volume>
          ,
          <string-name>
            <surname>Article</surname>
            <given-names>number</given-names>
          </string-name>
          : 1825 doi:10.1038/srep01825
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Dempsey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhowmick</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ali</surname>
          </string-name>
          .
          <article-title>Function-preserving Filters for Sampling in Biological Networks</article-title>
          .
          <source>Procedia Computer Science</source>
          ,Vol.
          <volume>9</volume>
          ,
          <fpage>587</fpage>
          -
          <lpage>595</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Flaxman</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Frieze</surname>
          </string-name>
          .
          <article-title>The diameter of randomly perturbed digraphs and some applications</article-title>
          .
          <source>APPROX-RANDOM</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hanson</surname>
          </string-name>
          ,
          <article-title>Logarithmic Market scoring rules for Modular Combinatorial Information Aggregation</article-title>
          .
          <source>Journal of Prediction Markets</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>15</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jumadinova</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Dasgupta</surname>
          </string-name>
          .
          <article-title>Distributed Decision Making in a Multi-agent Prediction Market using a Partially Observable Stochastic Game</article-title>
          .
          <source>Proceedings of the 13th International Conference on E-Commerce (ICEC)</source>
          . Liverpool, UK,:
          <volume>21</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>21</lpage>
          :
          <fpage>10</fpage>
          ,
          <year>2011</year>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jumadinova</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Dasgupta</surname>
          </string-name>
          ,
          <article-title>A Multi-Agent System for Analyzing the Effect of Information on Prediction Markets</article-title>
          .
          <source>Intl. J. of Intell. Systems</source>
          <volume>26</volume>
          (
          <issue>5</issue>
          ):
          <fpage>383</fpage>
          -
          <lpage>409</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M. E. J.</given-names>
            <surname>Newman</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Girvan</surname>
          </string-name>
          .
          <article-title>Finding and evaluating community structure in networks</article-title>
          .
          <source>Phys. Rev. E. 69</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.-Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.-J.</given-names>
            <surname>Slotine</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.-L.</given-names>
            <surname>Barabasi</surname>
          </string-name>
          .
          <article-title>Controllability of complex networks</article-title>
          .
          <source>Nature</source>
          <volume>473</volume>
          ,
          <fpage>167173</fpage>
          .
          <year>2011</year>
          . doi:
          <volume>10</volume>
          .1038/nature10011
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Russell</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Norvig. Artificial Intelligence</surname>
          </string-name>
          :
          <string-name>
            <given-names>A Modern</given-names>
            <surname>Approach</surname>
          </string-name>
          , Prentice Hall,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>V.</given-names>
            <surname>Ufimtsev</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhowmick</surname>
          </string-name>
          , Application of Group Testing in
          <source>Identifying High Betweenness Centrality Vertices in Complex Networks. 11th Workshop on Machine Learning with Graphs</source>
          ,
          <string-name>
            <surname>KDD</surname>
          </string-name>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wolfers</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Zitzewitz</surname>
          </string-name>
          . Prediction Markets.
          <source>Journal of Economic Perspectives</source>
          ,
          <volume>18</volume>
          (
          <issue>2</issue>
          ):
          <fpage>107</fpage>
          -
          <lpage>126</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>