<!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>Runtime Revision of Norms and Sanctions based on Agent Preferences (Extended Abstract)???</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Davide Dell'Anna</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mehdi Dastani</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabiano Dalpiaz</string-name>
          <email>f.dalpiazg@uu.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Utrecht University</institution>
          ,
          <addr-line>Utrecht</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>A multiagent system (MAS) comprises a set of autonomous agents that interact in a shared environment [9]. For example, a smart tra c system is a MAS that includes autonomous agents like cars, tra c lights, etc. The objectives of such a system include ensuring that each agent reaches its destination timely, and that the number of accidents is minimized. For a MAS to achieve its system-level objectives, the complexity and unpredictability of the agent interactions and of the environment must be taken into account. When engineering such systems, the available knowledge of these dynamics is only partial and incomplete. Therefore, MASs need to be regulated at runtime. Norm enforcement is a prominent mechanism for controlling and coordinating the runtime behavior of the agents in a MAS without over-constraining their autonomy [1,8]. Norm enforcement via sanctions is traditionally contrasted with norm regimentation, which prevents the agents from reaching certain states of a airs. For example, in a smart tra c system, a regimentation strategy could be to close a road to prevent cars from entering the road, while a sanctioning strategy could be to impose sanctions on cars that do enter the road. Existing research has studied the o ine revision of the enforced norms, and proposed logics that support norm change [2, 7], and studied the legal e ects of norm change [6]. In previous work [4] we have proposed a framework for engineering normative MASs that, using runtime data from MAS execution, revises the norms in the MAS to maximize the achievement of the system objectives. In such work, we made the simplistic assumption that norms are regimented and we introduced algorithms for switching among alternative norms. In this paper, we make a step forward toward the engineering of normative multiagent systems and we propose a regulatory mechanism that relies on norms with sanction. In our approach, we automatically revise the sanctions that are employed to enforce the norms. To do so, we rst interpret|through a Bayesian Network|runtime execution data in terms of how well certain norms contribute to the achievement of the system-level objectives in di erent operating contexts. Then, we suggest a revision of the sanctions using two di erent heuristic strategies, called Synergy and Sensitivity. The two strategies leverage the knowledge learned from runtime execution data and the knowledge about the</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        ? Copyright c 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
?? The full version of the paper appears in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
preferences of the agents in the MAS. We assume preferences to be speci ed in
terms of a desired state of a airs and the maximum payment that the agent
is willing to make to achieve the state of a airs. Agents' preferences provide an
estimation of the upper bound of the probability of violating a norm, given a
certain population of agents. Runtime execution data provides information about
the exhibited behavior of the agents (i.e., the exhibited probability of violating a
norm). Synergy and Sensitivity compare these two pieces of information and
determine new sanctions to use to enforce a norm in di erent operating contexts.
      </p>
      <p>Synergy: the new sanction is the closest sanction to the current one that
is expected to decrease the probability of violating a norm, in case of positive
synergy between norm and system-objectives (i.e., objectives are more likely
achieved when the norm is obeyed), or to increase it, in case of negative synergy.</p>
      <p>
        Sensitivity not only determines the direction of the revision{i.e.,
increasing or decreasing the probability of violating the norm{, but also provides an
estimation of the required change in such probability in order to make the norm
e ective for the achievement of the system-objectives. Such estimation is
obtained by performing sensitivity analysis for the Bayesian Network [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The new
sanction is then the sanction that is expected to change the probability of
violating a norm as required by Sensitivity.
      </p>
      <p>An evaluation through a tra c regulation simulation shows that our
heuristics outperform uninformed heuristics in terms of how fast they identify an
optimal solution (i.e., an optimal sanction for the enforced norm). We perform six
experiments, di ering in the distribution of types of agents and in the norm
enforced in the MAS. We show that in all experiments our informed heuristics,
and especially Sensitivity, provide a signi cant improvement in the number
of steps required to identify optimal sanctions (reducing the required number of
steps up to 98%), compared to the uninformed strategies.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Alechina</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bulling</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dastani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Logan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Practical run-time norm enforcement with bounded lookahead</article-title>
          .
          <source>In: Proc. of AAMAS</source>
          . pp.
          <volume>443</volume>
          {
          <issue>451</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aucher</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grossi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herzig</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lorini</surname>
          </string-name>
          , E.:
          <article-title>Dynamic context logic</article-title>
          .
          <source>In: Proc. of LORI</source>
          . pp.
          <volume>15</volume>
          {
          <issue>26</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chan</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Darwiche</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Sensitivity analysis in bayesian networks: From single to multiple parameters</article-title>
          .
          <source>In: Proc. of UAI</source>
          . pp.
          <volume>67</volume>
          {
          <issue>75</issue>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dell'Anna</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dastani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dalpiaz</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Runtime norm revision using bayesian networks</article-title>
          .
          <source>In: Proc. of PRIMA</source>
          . pp.
          <volume>279</volume>
          {
          <issue>295</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dell'Anna</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dastani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dalpiaz</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Runtime revision of norms and sanctions based on agent preferences</article-title>
          .
          <source>In: Proc. of AAMAS</source>
          . pp.
          <volume>1609</volume>
          {
          <issue>1617</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotolo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Changing legal systems: legal abrogations and annulments in defeasible logic</article-title>
          .
          <source>Logic Journal of the IGPL</source>
          <volume>18</volume>
          (
          <issue>1</issue>
          ),
          <volume>157</volume>
          {
          <fpage>194</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Knobbout</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dastani</surname>
          </string-name>
          , M., Meyer, J.C.
          <article-title>: A dynamic logic of norm change</article-title>
          .
          <source>In: Proc. of ECAI</source>
          . pp.
          <volume>886</volume>
          {
          <issue>894</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Testerink</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dastani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bulling</surname>
          </string-name>
          , N.:
          <article-title>Distributed controllers for norm enforcement</article-title>
          .
          <source>In: Proc. of ECAI</source>
          . pp.
          <volume>751</volume>
          {
          <issue>759</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Wooldridge</surname>
            ,
            <given-names>M.J.:</given-names>
          </string-name>
          <article-title>An Introduction to MultiAgent Systems (2</article-title>
          . ed.). Wiley (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>