Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Wierzbicki, A. ; Polish-Japanese Inst. of Inf. Technol., Warsaw, Poland ; Kucharski, T.

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:

Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on  (Volume:1 )

Date of Conference:

20-22 July 2005