dc.contributor.author |
Cristian, Robin |
en |
dc.contributor.author |
Fellows, Mike |
en |
dc.contributor.author |
Rosamond, Frances |
en |
dc.contributor.author |
Slinko, Arkadii |
en |
dc.date.accessioned |
2009-08-28T03:22:16Z |
en |
dc.date.available |
2009-08-28T03:22:16Z |
en |
dc.date.issued |
2005-02 |
en |
dc.identifier.citation |
Department of Mathematics - Research Reports-534 (2005) |
en |
dc.identifier.issn |
1173-0889 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/5088 |
en |
dc.description.abstract |
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. |
en |
dc.publisher |
Department of Mathematics, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Research Reports - Department of Mathematics |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.math.auckland.ac.nz/Research/Reports/view.php?id=534 |
en |
dc.title |
On Complexity of Lobbying in Multiple Referenda |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::230000 Mathematical Sciences::230100 Mathematics |
en |
dc.rights.holder |
The author(s) |
en |