On the Evaluation of a Cluster-based Reputation Assessment Mechanism for Carpooling Applications


== Abstract ==

Carpooling is a mobility concept that appears to be the answer when it comes to challenges in urban mobility derived by population growth. In carpooling, the same amount of people move with fewer vehicles leading to reduced traffic congestion and consequently to less CO2 emissions, fuel consumption and drivers frustration. However, there has always been scepticism around carpooling due to the inherent mistrust between drivers and passengers. In recent years, some reputation systems have been proposed to reduce the impact of mistrust on carpooling applications. Among them, the work of Salamanis et al. (Salamanis, 2018), in which a reputation assessment mechanism based on clustering users travel preferences, was introduced. In this paper, we provide an extended version of the previous mechanism and we thoroughly evaluate its robustness in relation with different types of malicious attacks and clustering algorithms. In addition, we compare our mechanism with a benchmarking reputation system that utilizes the simple arithmetic mean to calculate reputation values based on users ratings. The evaluation results indicate that the extended reputation assessment mechanism exhibits more robust behavior compared to the benchmarking system in all types of attacks when using the hierarchical clustering algorithm.


== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.5220/0007796602320241 http://dx.doi.org/10.5220/0007796602320241]

* [https://doi.org/10.5220/0007796602320241 https://doi.org/10.5220/0007796602320241] under the license cc-by-nc-nd

* [https://dblp.uni-trier.de/db/conf/vehits/vehits2019.html#MastorakisSKT19 https://dblp.uni-trier.de/db/conf/vehits/vehits2019.html#MastorakisSKT19],
: [https://academic.microsoft.com/#/detail/2947204390 https://academic.microsoft.com/#/detail/2947204390]