On Complexity of Lobbying in Multiple Referenda
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2006-19.
Length: 6 pages
Date of creation: 2006
Date of revision:
Contact details of provider:
Postal: CP 6128, Succ. Centre-Ville, Montréal, Québec, H3C 3J7
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC
lobbying; referendum; rametrized comexity;
Find related papers by JEL classification:
- D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-12-09 (All new papers)
- NEP-CDM-2006-12-09 (Collective Decision-Making)
- NEP-POL-2006-12-09 (Positive Political Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.