Cristian, RobinFellows, MikeRosamond, FrancesSlinko, Arkadii2009-08-282009-08-282005-02Department of Mathematics - Research Reports-534 (2005)1173-0889https://hdl.handle.net/2292/5088In 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.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of Research::230000 Mathematical Sciences::230100 MathematicsThe author(s)