By Topic

Fair and scalable peer-to-peer games of turns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Wierzbicki ; Polish-Japanese Inst. of Inf. Technol., Warsaw, Poland ; T. Kucharski

The article considers trust management in P2P games of turns without trusted, centralized resources and without using reputation. We improve a fair protocol for random drawing developed for P2P Scrabble by A. Wicrzbicki, T. Kucharski (2004). We also modify the public state management to use Byzantine agreements. The complexity of the proposed mechanisms is analyzed and a new mechanism for faster reshuffling and drawing during the game stage is proposed.

Published in:

11th International Conference on Parallel and Distributed Systems (ICPADS'05)  (Volume:1 )

Date of Conference:

20-22 July 2005