UNSPECIFIED (2005) Hybrid voting protocols and hardness of manipulation. In: 16th International Symposium on Algorithms and Computations (ISAAC 2005), DEC 19-21, 2005, Hainan, PEOPLES R CHINA.

Full text not available from this repository.

Abstract

This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more base protocols, and study the resulting class of (vote-once) hybrid voting protocols, which also includes most previously known manipulation-resistant protocols. We show that for many choices of underlying base protocols, including some that are easily manipulable, their hybrids are NP-hard to manipulate, and demonstrate that this method can be used to produce manipulation-resistant protocols with unique combinations of useful features.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	ALGORITHMS AND COMPUTATION
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-30935-7
ISSN:	0302-9743
Editor:	Deng, X and Du, D
Date:	2005
Volume:	3827
Number of Pages:	10
Page Range:	pp. 206-215
Publication Status:	Published
Title of Event:	16th International Symposium on Algorithms and Computations (ISAAC 2005)
Location of Event:	Hainan, PEOPLES R CHINA
Date(s) of Event:	DEC 19-21, 2005
URI:	http://wrap.warwick.ac.uk/id/eprint/33948

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item