SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Some results on approximating the minimax solution in approval voting
9 references·0 citing·32 second hopsampled
Some results on approximating the minimax solution in approval voting (2007)Some results on approximating the minimax…Multi-winner elections: complexity of manipulation, control, and winner-determination (2007)Multi-winner elections: compl…A minimax procedure for electing committees (2007)A minimax procedure for elect…Hybrid Voting Protocols and Hardness of Manipulation (2005)Hybrid Voting Protocols and H…Universal Voting Protocol Tweaks to Make Manipulation Hard (2003)Universal Voting Protocol Twe…How many candidates are needed to make elections hard to manipulate? (2003)How many candidates are neede…Complexity of Manipulating Elections with Few Candidates (2002)Complexity of Manipulating El…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…The computational difficulty of manipulating an election (1989)The computational difficulty …Manipulation of Voting Schemes: A General Result (1973)Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Voting schemes for which it can be difficult to tell who won the election (1989)Junta distributions and the average-case complexity of manipulating elections (2006)Approximability of manipulating elections (2008)Nonuniform bribery (2008)Single transferable vote resists strategic voting (1991)Computing slater rankings using similarities among candidates (2006)Dominating Manipulations in Voting with Partial Information (2011)Barriers to Manipulation in Voting (2016)A theory of justice original edition (1971)Approval Voting (1978)Approval Balloting for Multi-winner Elections (2010)Handbook of Social Choice and Welfare (2011)Judgment Aggregation: A Primer (2014)Computational Aspects of Multi-Winner Approval Voting (2015)The decision and the organization (1965)Computationally feasible VCG mechanisms (2000)A Short Introduction to Computational Social Choice (2007)Social Choice and Individual Values. (1951)Multipart pricing of public goods (1971)Algorithmic mechanism design (extended abstract) (1999)Algorithmic Mechanism Design (2001)Collective privacy management in social networks (2009)Elections Can be Manipulated Often (2008)Complexity of unweighted coalitional manipulation under some common voting rules (2009)Convergence to Equilibria in Plurality Voting (2010)The complexity of bribery in elections (2006)Coalitional skill games (2008)When are elections with few candidates hard to manipulate? (2007)The Strategy-Proofness Landscape of Merging (1999)Average-case tractability of manipulation in voting via the fraction of manipulators (2007)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1989The computational difficulty of manipulating an election530 cited
  • 1992How hard is it to control an election?391 cited
  • 1991The Clarke tax as a consensus mechanism among automated agents183 cited
  • 2007A minimax procedure for electing committees162 cited
  • 2003Universal Voting Protocol Tweaks to Make Manipulation Hard114 cited
  • 2002Complexity of Manipulating Elections with Few Candidates108 cited
  • 2005Hybrid Voting Protocols and Hardness of Manipulation99 cited
  • 2003How many candidates are needed to make elections hard to manipulate?63 cited
  • 2007Multi-winner elections: complexity of manipulation, control, and winner-determination61 cited

Cited by

No citing works inside the corpus for this window.

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