SZodixStudyAcademic Library

Shelves Open access

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

Parameterized computational complexity of Dodgson and Young elections · Study

ArticleShelves

ArticleParameterized computational complexity of Dodgson and Young elections

Nadja Betzler2009

OA

Articlebronze2009

Parameterized computational complexity of Dodgson and Young elections

Nadja Betzler · Jiong Guo · Rolf Niedermeier

56 citations·0/0 files stored·Information and Computation

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 Advanced Graph Theory Research

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 — 56 citations exist upstream.

References

1989Voting schemes for which it can be difficult to tell who won the election 1995Classics of Social Choice 2007When are elections with few candidates hard to manipulate?2007A Short Introduction to Computational Social Choice 2007Anyone but him: The complexity of precluding an alternative 1997Exact analysis of Dodgson elections 2003Exact Complexity of the Winner Problem for Young Elections 2006Dichotomy for voting systems

Related works

Explore the map →

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

2009Hybrid Elections Broaden Complexity‐Theoretic Resistance to Controlarticle · 10 shared references 2010Computational Aspects of Approval Votingchapter · 10 shared references 2011Multimode Control Attacks on Electionsarticle · 7 shared references 2009A Richer Understanding of the Complexity of Election Systemschapter · 7 shared references 2015Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electoratesarticle · 7 shared references 2009Parameterized complexity of candidate control in elections and related digraph problemsarticle · 7 shared references

Details

Year2009

Typearticle

Published2009-10-05

VenueInformation and Computation

ISSN-L0890-5401

Languageen

Citations56

Files0 public / 0

ShelfGame Theory and Voting Systems

Identifiers

doi10.1016/j.ic.2009.10.001

openalex_workW2004181309

Links

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