<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">A Collaborative System Based on Reputation for Wide-Scale Public Participation</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Ana</forename><surname>Fernández</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Departamento de Ciencia de la Computación</orgName>
								<orgName type="institution">Pontificia Universidad Católica de Chile Vicuña Mackenna</orgName>
								<address>
									<addrLine>4860 (143)</addrLine>
									<settlement>Macul, Santiago</settlement>
									<country key="CL">Chile</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jens</forename><surname>Hardings</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Departamento de Ciencia de la Computación</orgName>
								<orgName type="institution">Pontificia Universidad Católica de Chile Vicuña Mackenna</orgName>
								<address>
									<addrLine>4860 (143)</addrLine>
									<settlement>Macul, Santiago</settlement>
									<country key="CL">Chile</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">A Collaborative System Based on Reputation for Wide-Scale Public Participation</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">DDC62DC3EBE82471879E85C05B00546C</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T12:37+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Reputation system</term>
					<term>public participation</term>
					<term>e-democracy</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>This article proposes the use of a reputation system to promote trust among participants and the system construction over an online social network.</p><p>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.</p><p>Reference <ref type="bibr" target="#b0">[1]</ref> 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.</p><p>In reference <ref type="bibr" target="#b1">[2]</ref>, 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.</p><p>In reference <ref type="bibr" target="#b2">[3]</ref> 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 <ref type="bibr" target="#b2">[3]</ref> presents a simple reputation calculation based only in the median of past reputations.</p><p>In <ref type="bibr" target="#b3">[4]</ref> 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><p>Workshop on Adaptation and Personalization for Web 2.0, UMAP'09, June <ref type="bibr">[22]</ref><ref type="bibr">[23]</ref><ref type="bibr">[24]</ref><ref type="bibr">[25]</ref><ref type="bibr">[26]</ref><ref type="bibr">2009</ref> 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Reputation Systems</head><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 <ref type="bibr" target="#b4">[5]</ref>, 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 <ref type="bibr" target="#b5">[6]</ref>.</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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Proposed Reputation Model</head><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 P i C 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 1 0</p><formula xml:id="formula_0">  P i C for   m i ,..., 1 </formula><p>. Each contribution should have different importance in the system, for such reason we will identify i  as the importance weight of P i C which values will go between 0 and 1. We then define the participating reputation P R of user a as:</p><formula xml:id="formula_1">    a C a R m i P i i P   1  (1)</formula><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, L i C 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 Workshop on Adaptation and Personalization for Web 2.0, UMAP'09, June 22-26, 2009 values will satisfy</p><formula xml:id="formula_2">1 0   L i C for   n i ,..., 1 </formula><p>. We will define i  as the weight of L i C in the system which values will go between 0 and 1. The leadership reputation L R of user a will then be defined as:</p><formula xml:id="formula_3">    a C a R n i L i i L   1  . (<label>2</label></formula><formula xml:id="formula_4">)</formula><p>Users in the system can be qualified by others for a performed activity. Agent a will be rated and given a qualification</p><formula xml:id="formula_5">Q q  where   0 , 1  Q</formula><p>which represent a positive or negative qualification respectively. a Q represents the time-sorted list of qualifications of user a assigned by other users where  </p><formula xml:id="formula_6">1 a Q is the oldest rate and   h Q a</formula><p>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</p><formula xml:id="formula_7">1  h</formula><p>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 <ref type="bibr" target="#b6">[7]</ref> 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 Q R of user a will then be defined as:</p><formula xml:id="formula_8">           h j a Q j h j Q a R 1 2 1 .<label>(3)</label></formula><p>The chosen model is based in the one described in <ref type="bibr" target="#b7">[8]</ref>. 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   a T 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><formula xml:id="formula_9">        a T L P k a R a R a F    .<label>(4)</label></formula><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:</p><formula xml:id="formula_10">        1 1 1     a R a R a Trust Q a F Q . (<label>5</label></formula><formula xml:id="formula_11">)</formula><p>4 Deployed System</p><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 <ref type="figure">1</ref> 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">Conclusions</head><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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>3 Fig. 1 .</head><label>31</label><figDesc>Fig. 1. Evolution of trust for different users.</figDesc></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Hagen</surname></persName>
		</author>
		<title level="m">Elektronische Demokratie: Comput-ernetzwerke und politische Theorie in den USA</title>
				<meeting><address><addrLine>Hamburg</addrLine></address></meeting>
		<imprint>
			<publisher>Lit-Verlagsgsellschaft</publisher>
			<date type="published" when="1997">1997</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A Computational Trust Model for C2C Auctions</title>
		<author>
			<persName><forename type="middle">W</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of ICSSSM &apos;05</title>
				<meeting>ICSSSM &apos;05</meeting>
		<imprint>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Towards Reputation Systems Applied to Communities of Practice</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">C P</forename><surname>Cruz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T A</forename><surname>Gouvêa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L R</forename><surname>Motta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">M</forename><surname>Santoro</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE</title>
		<imprint>
			<biblScope unit="page" from="74" to="79" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">A Protocol to Increase the Security in a MANET Based on Trust and Reputation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Fernández</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hardings</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Tenth International Symposium on Communication Theory and Applications (ISCTA &apos;09)</title>
				<meeting><address><addrLine>Ambleside, UK</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2009-07">July, 2009</date>
			<biblScope unit="page" from="13" to="17" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Powertrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing</title>
		<author>
			<persName><forename type="first">R</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Hwang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Parallel Distrib. Syst</title>
		<imprint>
			<biblScope unit="page" from="460" to="473" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Dirichlet Reputation Systems</title>
		<author>
			<persName><forename type="first">A</forename><surname>Josang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Haller</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">The Second International Conference on Availability, Reliability and Security</title>
				<imprint>
			<date type="published" when="2007">2007</date>
			<biblScope unit="page" from="112" to="119" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Comparing and Evaluating Metrics for Reputation Systems by Simulation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Schlosser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Voss</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the IEEE Workshop on Reputation in Agent Societies</title>
				<meeting>the IEEE Workshop on Reputation in Agent Societies</meeting>
		<imprint>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">An Efficient Trust-Based Reputation Protocol for Wireless and Mobile Ad Hoc Networks: Proof and Correctness</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Ren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Boukerche</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Workshop on Adaptation and Personalization for Web 2.0, UMAP&apos;09</title>
				<imprint>
			<date type="published" when="2008-06-22">2008. June 22-26, 2009</date>
		</imprint>
	</monogr>
	<note>Proceedings of the IEEE GLOBECOM</note>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
