On complexity of lobbying in multiple referenda
- First Online:
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.
KeywordsLobbying Referendum Parametrized complexity
JEL Classification NumbersD72
Unable to display preview. Download preview PDF.