On Complexity of Lobbying in Multiple Referenda
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.
|Date of creation:||2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:mtl:montde:2006-19. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sharon BREWER)
If references are entirely missing, you can add them using this form.