DocumentCode :
442926
Title :
Fair and scalable peer-to-peer games of turns
Author :
Wierzbicki, Adam ; Kucharski, Tomasz
Author_Institution :
Polish-Japanese Inst. of Inf. Technol., Warsaw, Poland
Volume :
1
fYear :
2005
fDate :
20-22 July 2005
Firstpage :
250
Abstract :
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.
Keywords :
computer games; peer-to-peer computing; protocols; Byzantine agreement; P2P Scrabble; peer-to-peer game of turns; public state management; random drawing; trust management; Algorithm design and analysis; Application software; Authentication; Bridges; Computer networks; Information technology; Peer to peer computing; Protocols; Resource management; Roads;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on
ISSN :
1521-9097
Print_ISBN :
0-7695-2281-5
Type :
conf
DOI :
10.1109/ICPADS.2005.154
Filename :
1531135
Link To Document :
بازگشت