- Title
- On complexity of lobbying in multiple referenda
- Creator
- Christian, Robin; Fellows, Mike; Rosamond, Frances; Slinko, Arkadii
- Relation
- First International Workshop on Computational Social Choice (COMSOC-2006). Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC-2006) (Amsterdam 6-8 December, 2006 )
- Relation
- http://staff.science.uva.nl/~ulle/COMSOC-2006/proceedings.html
- Publisher
- Institute for Logic, Language and Computation (ILLC)
- Resource Type
- conference paper
- Date
- 2006
- Description
- 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.
- Subject
- direct democracy; parametrized complexity; political lobbying
- Identifier
- uon:2613
- Identifier
- http://hdl.handle.net/1959.13/29767
- Full Text
- Reviewed
- Hits: 1402
- Visitors: 1585
- Downloads: 245
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT01 | Publisher version (open access) | 154 KB | Adobe Acrobat PDF | View Details Download |