On Complexity of Lobbying in Multiple Referenda

Robin Cristian, Mike Fellows, Frances Rosamond, Arkadii Slinko


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.

parametrized complexity, lobbying, multiple referenda

Math Review Classification
Primary 03 D15, 91 B12

Last Updated
15 February 05

7 pages

This article is available in: