SZodixStudyAcademic Library

Shelves Open access

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

The complexity of Kemeny elections · Study

ArticleShelves

ArticleThe complexity of Kemeny elections

Edith Hemaspaandra2005

OA

Articlebronze2005

The complexity of Kemeny elections

Edith Hemaspaandra · Holger Spakowski · Jörg Vogel

184 citations·0/0 files stored·Theoretical Computer Science

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 Complexity and Algorithms in Graphs 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 — 184 citations exist upstream.

References

1951Social Choice and Individual Values.1952Social Choice and Individual Values 1989Voting schemes for which it can be difficult to tell who won the election 1978A Consistent Extension of Condorcet’s Election Principle 1953A Theorem on the Construction of Voting Paradoxes 1997Exact analysis of Dodgson elections

Cited by

2005Voting procedures with incomplete preferences 2012Computational Social Choice 2009Preference functions that score rankings and maximum likelihood estimation 2006Dichotomy for voting systems 2011Multimode Control Attacks on Elections 2009A Richer Understanding of the Complexity of Election Systems 2015Achieving fully proportional representation: Approximability results 2010Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates

Related works

Explore the map →

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

2009Llull and Copeland Voting Computationally Resist Bribery and Constructive Controlarticle · 4 shared references 2002Chapter 4 Voting procedureschapter · 4 shared references 2004Interpersonally Comparable Utilitychapter · 4 shared references 2006The complexity of bribery in electionsarticle · 4 shared references 1989Median linear orders: Heuristics and a branch and bound algorithmarticle · 4 shared references 2011Review of Paradoxes Afflicting Procedures for Electing a Single Candidatechapter · 4 shared references

Details

Year2005

Typearticle

Published2005-10-18

VenueTheoretical Computer Science

ISSN-L0304-3975

Languageen

Citations184

Files0 public / 0

ShelfGame Theory and Voting Systems

Identifiers

doi10.1016/j.tcs.2005.08.031

openalex_workW2057573268

Links

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