SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The computational difficulty of manipulating an election · Study

ArticleShelves

ArticleThe computational difficulty of manipulating an election

John J. Bartholdi1989

Article1989

The computational difficulty of manipulating an election

John J. Bartholdi · Craig A. Tovey · Michael A. Trick

530 citations·0/0 files stored·Social Choice and Welfare

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Voting Systems Electoral Systems and Political Participation Internet Traffic Analysis and Secure E-voting

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 530 citations exist upstream.

References

1973Manipulation of Voting Schemes: A General Result 1975Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions 1989Voting schemes for which it can be difficult to tell who won the election

Cited by

1991Single transferable vote resists strategic voting 1992How hard is it to control an election?2007When are elections with few candidates hard to manipulate?2016The Unreasonable Fairness of Maximum Nash Welfare 2019The Unreasonable Fairness of Maximum Nash Welfare 2007A Short Introduction to Computational Social Choice 2002Complexity of Mechanism Design 2007Anyone but him: The complexity of precluding an alternative

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1991Single transferable vote resists strategic votingarticle · 3 shared references 2007When are elections with few candidates hard to manipulate?article · 3 shared references 2007A Short Introduction to Computational Social Choiceother · 3 shared references 2003Democracy Defendedbook · 3 shared references 2011Determining Possible and Necessary Winners Given Partial Ordersarticle · 3 shared references 2006Improved bounds for computing Kemeny rankingsarticle · 3 shared references

Details

Year1989

Typearticle

Published1989-07-01

VenueSocial Choice and Welfare

ISSN-L0176-1714

Languageen

Citations530

Files0 public / 0

ShelfGame Theory and Voting Systems

Identifiers

doi10.1007/bf00295861

openalex_workW2003296459

Links

Imported from OpenAlex (CC0) — nothing here is generated.