NOVA. The University of Newcastle's Digital Repository

Description	Size	Format
Publisher version (open access)	154 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/29767

Title

On complexity of lobbying in multiple referenda

Author/Creator

Christian, Robin;  Fellows, Mike;  Rosamond, Frances;  Slinko, Arkadii

Description

In this paper we show that lobbying in conditions of "direct democracy" is virtually impossible, even in conditions of complete information about voters preferences, since it would require solving a very computationally hard problem. We use the apparatus of parametrized complexity for this purpose.

Relation

First International Workshop on Computational Social Choice (COMSOC-2006). Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC-2006) (Amsterdam 6-8 December, 2006 )

Relation

http://staff.science.uva.nl/~ulle/COMSOC-2006/proceedings.html

Date

2006

Publisher

Institute for Logic, Language and Computation (ILLC)

Keyword(s)

direct democracy;  parametrized complexity;  political lobbying

Resource Type

conference paper

Identifier

http://hdl.handle.net/1959.13/29767

---

Reviewed

Full Text

 

Save/E-mail Citation

Citation Format

Plain Text Citation HTML Citation EndNote Format

E-mail Address

Subject

"On complexity of lobbying in multiple referenda"

 

OR