On complexity of lobbying in multiple referenda
Open Access
- 14 July 2007
- journal article
- Published by Springer Science and Business Media LLC in Review of Economic Design
- Vol. 11 (3), 217-224
- https://doi.org/10.1007/s10058-007-0028-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Richer Understanding of the Complexity of Election SystemsPublished by Springer Science and Business Media LLC ,2009
- Rank aggregation methods for the WebPublished by Association for Computing Machinery (ACM) ,2001
- Computational Politics: Electoral SystemsLecture Notes in Computer Science, 2000
- Parameterized ComplexityMonographs in Computer Science, 1999
- How hard is it to control an election?Mathematical and Computer Modelling, 1992
- Single transferable vote resists strategic votingSocial Choice and Welfare, 1991
- Recognizing majority-rule equilibrium in spatial voting gamesSocial Choice and Welfare, 1991
- The computational difficulty of manipulating an electionSocial Choice and Welfare, 1989
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989
- New directions in cryptographyIEEE Transactions on Information Theory, 1976