On Complexity of Lobbying in Multiple Referenda
Article [Version of Record]
Is part ofCahier de recherche ; #2006-19
Publisher(s)Université de Montréal. Département de sciences économiques.
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.