Show simple item record

dc.contributor.authorChristoforou, Evgeniaen
dc.contributor.authorFernández Anta, Antonioen
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorMosteiro, Miguel A.en
dc.contributor.authorSánchez, A.en
dc.creatorChristoforou, Evgeniaen
dc.creatorFernández Anta, Antonioen
dc.creatorGeorgiou, Chryssisen
dc.creatorMosteiro, Miguel A.en
dc.creatorSánchez, A.en
dc.date.accessioned2019-11-13T10:39:19Z
dc.date.available2019-11-13T10:39:19Z
dc.date.issued2013
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53739
dc.description.abstractWe consider Internet-based Master-Worker task computing systems, such as SETI@home, where a master sends tasks to potentially unreliable workers, and the workers execute and report back the result. We model such computations using evolutionary dynamics and consider three type of workers: altruistic, malicious and rational. Altruistic workers always compute and return the correct result, malicious workers always return an incorrect result, and rational (selfish) workers decide to be truthful or to cheat, based on the strategy that increases their benefit. The goal of the master is to reach eventual correctness, that is, reach a state of the computation that always receives the correct results. To this respect, we propose a mechanism that uses reinforcement learning to induce a correct behavior to rational workersen
dc.description.abstractto cope with malice we employ reputation schemes. We analyze our reputation-based mechanism modeling it as a Markov chain and we give provable guarantees under which truthful behavior can be ensured. Simulation results, obtained using parameter values that are likely to occur in practice, reveal interesting trade-offs between various metrics, parameters and reputation types, affecting cost, time of convergence to a truthful behavior and tolerance to cheaters. © 2013 Springer International Publishing.en
dc.source17th International Conference on Principles of Distributed Systems, OPODIS 2013en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84893032157&doi=10.1007%2f978-3-319-03850-6_8&partnerID=40&md5=cdc9fd8ca56828d6fa6caa613bab4364
dc.subjectInternet baseden
dc.subjectDistributed computer systemsen
dc.subjectMarkov processesen
dc.subjectreputationen
dc.subjectVirtual realityen
dc.subjectTask computingen
dc.subjectVolunteer computingen
dc.subjectreinforcement learningen
dc.subjectEvolutionary dynamicsen
dc.subjectevolutionary game theoryen
dc.subjectMechanism modelen
dc.subjectReputation schemesen
dc.titleReputation-based mechanisms for evolutionary master-worker computingen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1007/978-3-319-03850-6_8
dc.description.volume8304 LNCSen
dc.description.startingpage98
dc.description.endingpage113
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Conference code: 102235en
dc.description.notesCited By :5</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]
dc.contributor.orcidFernández Anta, Antonio [0000-0001-6501-2377]
dc.gnosis.orcid0000-0003-4360-0260
dc.gnosis.orcid0000-0001-6501-2377


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record