<!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>A Collaborative System Based on Reputation for Wide-Scale Public Participation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ana Fernández</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jens Hardings</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Departamento de Ciencia de la Computación, Pontificia Universidad Católica de Chile Vicuña Mackenna 4860 (143)</institution>
          ,
          <addr-line>Macul, Santiago</addr-line>
          ,
          <country country="CL">Chile</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2009</year>
      </pub-date>
      <fpage>22</fpage>
      <lpage>26</lpage>
      <abstract>
        <p>The aim of this paper is to use a reputation system to promote trust among participants of an online social network. By the use of past behaviour and ratings from other users, this paper presents a novel metric to compute the reputation of peers. Also a prototype and deployment results are included. This article proposes the use of a reputation system to promote trust among participants and the system construction over an online social network. Although reputation systems are being used in several fields, it has not yet been implemented in politics and citizen participation. We have not found other attempts of reputation systems for the world of politics in order to promote participation and edemocracy between peers. Reference [1] defines e-democracy as the sum of acts realized by individuals or groups in order to influence the way the political system operates. Due to the Internet, citizens can easily access political content and such an increased access to political information should extend governmental transparency and thus democracy. In reference [2], a proposal over the Internet where players have to cope with uncertainty from quality of products and trustworthiness of participants is presented. The method to address this predicament is to use feedback ratings about past behaviour to make recommendations about who to trust. In reference [3] a proposal for the use of reputation systems in Communities of Practice (CoPs) was presented in order to assist users in creating relationships for honest and useful participation, based on trust, for the benefit of the entire community. Indeed [3] presents a simple reputation calculation based only in the median of past reputations. In [4] we have used reputation systems in a Mobile Ad hoc Network (MANET) which is a low complexity system. But in this paper we offer a generalisation of the use of reputation systems to a more complex framework represented by the world of politics with the aim to promote participation and e-democracy between peers.</p>
      </abstract>
      <kwd-group>
        <kwd>Reputation system</kwd>
        <kwd>public participation</kwd>
        <kwd>e-democracy</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>The paper is organized as follows: section 2 presents reputation systems concepts
and issues; section 3 presents the proposed reputation model with its respective
reputation metric; section 4 presents the deployed system; and finally, section 5
discusses our conclusions.</p>
    </sec>
    <sec id="sec-2">
      <title>2 Reputation Systems</title>
      <p>Many interactions in real world are based on rumours or on friends’ experiences.
As a result of this, future interactions can be influenced by past interactions. We call
this the reputation of a user. Keeping that in mind we can build a system that collects,
processes and distributes information about the quality of interactions. Referring to
[5], we call such system a “reputation system”. Reputation systems are well suited for
stimulating social control within online communities. The idea is to let parties rate
each other and use those ratings to derive a reputation score, which can assist other
parties in deciding whether or not to transact with that party in the future [6].</p>
      <p>Reputation systems need models in order to calculate the reputation of its users,
that is, a way to obtain a qualification for each individual, using information stored in
the system. Many reputation models have been proposed for online environments
systems throughout the past years, but there is not an accepted common model yet.</p>
    </sec>
    <sec id="sec-3">
      <title>3 Proposed Reputation Model</title>
      <p>In our model we identified several factors that influence on the reputation of a user
in the system which will be described as follows.</p>
      <p>Whenever a user participates in the system he should be rewarded. A good way to
measure the participation is by the relative contribution factor which will be the
amount of actions executed by a user over the amount of total actions. We will denote
CiP as the relative contribution factor for participation which has been divided in m
areas, where m represents the amount of participation dimensions measured by the
system, and its values will satisfy 0  CiP  1 for i  1,..., m. Each contribution
should have different importance in the system, for such reason we will identify  i as
the importance weight of CiP which values will go between 0 and 1. We then define
the participating reputation RP of user a as:</p>
      <p>
        m
RP a   iCiP a
i1
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
      </p>
      <p>Certain users have the ability to generate participation in others and such ability
should be rewarded by the system. In a similar way to participating reputation, CiL
represents the contribution factor for leadership which will be sorted out in n
different areas, where n represents the amount of leadership dimensions and its
values will satisfy</p>
      <p>0  CiL  1 for i  1,..., n. We will define  i as the weight of
CiL in the system which values will go between 0 and 1. The leadership reputation
RL of user a will then be defined as:</p>
      <p>n
RL a   iCiL a.</p>
      <p>i1</p>
      <p>Users in the system can be qualified by others for a performed activity. Agent a
will be rated and given a qualification q  Q where Q  1,0 which represent a
positive or negative qualification respectively. Qa represents the time-sorted list of
qualifications of user a assigned by other users where Qa 1 is the oldest rate and
Qa h is the most recent. Each user in the system will have an ordered list used to
store his last h qualifications. When a new qualification h  1 arrives, the oldest one
comes out of the list like a FIFO array.</p>
      <p>Agents will behave more probably like they did in their most recent transactions.
Therefore we chose a metric called BlurredSquared [7] which computes a weighted
sum of all ratings. The older a rating is, the less it influences the current reputation. In
our particular case the reputation will only be calculated with the last h qualifications.</p>
      <p>The peer reputation RQ of user a will then be defined as:</p>
      <p>h
RQ a  j1h  j  12 .</p>
      <p>Qa  j</p>
      <p>The chosen model is based in the one described in [8]. The essential distinction
between that metric and ours is that this novel metric considers qualifications from
other nodes assigning more importance to the most recent ones.</p>
      <p>We will define F as a function that determines the level of recent activity of a
certain node. Let T a be the residential time of user a in the system and let k be a
discount factor between 0 and 1 that will be chosen in order to decrease the level of
participation when the time spent in the system is higher and increase it when it is
shorter. The level of recent activity for user a will be:</p>
      <p>F a  RP a RL a k T a .</p>
      <p>Our model computes the global reputation or trust of a user based on two factors:
past qualifications and level of recent activity. Trust for user a will be calculated as:
Trusta </p>
      <p>RQ a1F a  1</p>
      <p>RQ a  1</p>
      <p>
        .
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
1,4
t
rsu1,3
T
1,2
1,1
1
User 1
User 2
User 3
      </p>
    </sec>
    <sec id="sec-4">
      <title>4 Deployed System</title>
      <p>The proposed system was implemented in the Alumni Center of the Faculty of
Engineering of Universidad Católica de Chile using the well-known social network
Facebook. Such implementation offers a participation platform for students as it
permits them to express their concerns and ideas and allows others to vote or
comment about them. The previously described model was applied in order to
determine the improvement of trust among peers.</p>
      <p>Figure 1 shows the evolution of trust for several users. Initially all users begin with
the same trust value. Their behaviour in the system and the qualifications assigned by
others determines the progress of their trust. User 1 has an increasing participation
and leadership reputation as well as a good reputation among other peers; therefore
his level of trust increases significantly over time. User 2 presents a decreasing
participating reputation but an incremental leadership and a high reputation. Finally
User 3 has a poor participation in the system and is not well qualified by others for
that reason it presents a decreasing trust value as time passes by.</p>
      <p>Time</p>
    </sec>
    <sec id="sec-5">
      <title>5 Conclusions</title>
      <p>This paper reflects the behaviour of a user in the system and the quality of his
contribution in his trust value. As a direct consequence arises the fact that users with
high level of trust are comparatively better users and therefore will eventually come
with good ideas that could be used as part of future policies in the world of politics.</p>
      <p>From simulation we can conclude that good behaviour in the past and the use of
ratings from other participants is a high-quality metric in a social network.</p>
      <p>A trust-based system built over a well-known social network brings a great
opportunity to participate for all interested users as well as an opportunity to identify
high-quality users whom may become in the leaders for tomorrow.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Elektronische Demokratie:
          <article-title>Comput-ernetzwerke und politische Theorie in den USA</article-title>
          , Lit-Verlagsgsellschaft,
          <source>Hamburg</source>
          (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          . W.,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>A Computational Trust Model for C2C Auctions</article-title>
          .
          <source>Proceedings of ICSSSM '05</source>
          . (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cruz</surname>
            ,
            <given-names>C. C. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gouvêa</surname>
            ,
            <given-names>M. T. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Motta</surname>
            ,
            <given-names>C. L. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santoro</surname>
            ,
            <given-names>F. M.</given-names>
          </string-name>
          :
          <article-title>Towards Reputation Systems Applied to Communities of Practice</article-title>
          . IEEE.
          <volume>74</volume>
          -
          <fpage>79</fpage>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fernández</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hardings</surname>
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A Protocol to Increase the Security in a MANET Based on Trust and Reputation</article-title>
          . To be presented at Tenth
          <source>International Symposium on Communication Theory and Applications (ISCTA '09)</source>
          ,
          <fpage>13th</fpage>
          - 17th
          <string-name>
            <surname>July</surname>
          </string-name>
          ,
          <year>2009</year>
          , Ambleside, UK.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Powertrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing</article-title>
          .
          <source>IEEE Trans. Parallel Distrib. Syst</source>
          .
          <fpage>460</fpage>
          --
          <lpage>473</lpage>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Josang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haller</surname>
          </string-name>
          , J.:
          <source>Dirichlet Reputation Systems. The Second International Conference on Availability, Reliability and Security</source>
          .
          <fpage>112</fpage>
          --
          <lpage>119</lpage>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Schlosser</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voss</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Comparing and Evaluating Metrics for Reputation Systems by Simulation</article-title>
          .
          <source>Proceedings of the IEEE Workshop on Reputation in Agent Societies</source>
          .(
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boukerche</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An Efficient Trust-Based Reputation Protocol for Wireless and Mobile Ad Hoc Networks: Proof and Correctness</article-title>
          .
          <source>Proceedings of the IEEE GLOBECOM</source>
          , (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>