SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On complexity of lobbying in multiple referenda
10 references·3 citing·31 second hopsampled
On complexity of lobbying in multiple referenda (2007)On complexity of lobbying in multiple ref…A Richer Understanding of the Complexity of Election Systems (2009)A Richer Understanding of the…The complexity of Kemeny elections (2005)The complexity of Kemeny elec…Exact Complexity of the Winner Problem for Young Elections (2003)Exact Complexity of the Winne…Complexity of Manipulating Elections with Few Candidates (2002)Complexity of Manipulating El…Exact analysis of Dodgson elections (1997)Exact analysis of Dodgson ele…How hard is it to control an election? (1992)How hard is it to control an …The Clarke tax as a consensus mechanism among automated agents (1991)The Clarke tax as a consensus…Single transferable vote resists strategic voting (1991)Single transferable vote resi…Voting schemes for which it can be difficult to tell who won the election (1989)Voting schemes for which it c…The computational difficulty of manipulating an election (1989)The computational difficulty …On the Computation of Fully Proportional Representation (2013)On the Computation of Fully P…Parameterized computational complexity of Dodgson and Young elections (2009)Parameterized computational c…Parameterized complexity of candidate control in elections and related digraph problems (2009)Parameterized complexity of c…The Theory of Committees and Elections. (1959)Manipulation of Voting Schemes: A General Result (1973)Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (2010)Towards a dichotomy for the Possible Winner problem in elections based on scoring rules (2010)The complexity of manipulative attacks in nearly single-peaked electorates (2013)Journal of Universal Computer Science (2020)Social Choice and Individual Values. (1951)Condorcet Social Choice Functions (1977)Dichotomy for voting systems (2006)Eliciting Single-Peaked Preferences Using Comparison Queries (2009)Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Hybrid Voting Protocols and Hardness of Manipulation (2005)Computing slater rankings using similarities among candidates (2006)The complexity of bribery in elections (2006)Social Choice Theory and Deliberative Democracy: A Reconciliation (2002)Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (2014)Social Choice and Individual Values (1952)Voting procedures with incomplete preferences (2005)Preference functions that score rankings and maximum likelihood estimation (2009)Computational Social Choice (2012)Public choice II (1989)Determining Possible and Necessary Winners Given Partial Orders (2011)A Short Introduction to Computational Social Choice (2007)Considerations on Representative Government (2010)The decision and the organization (1965)Anyone but him: The complexity of precluding an alternative (2007)Multipart pricing of public goods (1971)Collective privacy management in social networks (2009)The shield that never was: Societies with single-peaked preferences are more open to manipulation and control (2010)Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains (2011)When are elections with few candidates hard to manipulate? (2007)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1989Voting schemes for which it can be difficult to tell who won the election548 cited
  • 1989The computational difficulty of manipulating an election530 cited
  • 1991Single transferable vote resists strategic voting394 cited
  • 1992How hard is it to control an election?391 cited
  • 1997Exact analysis of Dodgson elections186 cited
  • 2005The complexity of Kemeny elections184 cited
  • 1991The Clarke tax as a consensus mechanism among automated agents183 cited
  • 2003Exact Complexity of the Winner Problem for Young Elections128 cited
  • 2009A Richer Understanding of the Complexity of Election Systems108 cited
  • 2002Complexity of Manipulating Elections with Few Candidates108 cited

Cited by

  • 2009Parameterized complexity of candidate control in elections and related digraph problems67 cited
  • 2013On the Computation of Fully Proportional Representation66 cited
  • 2009Parameterized computational complexity of Dodgson and Young elections56 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work