SZodixStudyAcademic Library

Shelves Open access

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

Swap Bribery · Study

WorkSwap Bribery

Edith Elkind2009

OA

Workgreen2009

Swap Bribery

Edith Elkind · Piotr Faliszewski · Arkadii M. Slinko

119 citations·0/0 files stored·Lecture notes in 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 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 — 119 citations exist upstream.

References

1989The computational difficulty of manipulating an election 2007When are elections with few candidates hard to manipulate?2009Llull and Copeland Voting Computationally Resist Bribery and Constructive Control 2005Voting procedures with incomplete preferences 2007Uncertainty in preference elicitation and aggregation 2008Algorithms for the coalitional manipulation problem

Cited by

2010Towards a dichotomy for the Possible Winner problem in elections based on scoring rules 2013The complexity of manipulative attacks in nearly single-peaked electorates 2011Multivariate Complexity Analysis of Swap Bribery

Related works

Explore the map →

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

2011Dominating Manipulations in Voting with Partial Informationother · 5 shared references 2012Computational Social Choicearticle · 4 shared references 2011Multimode Control Attacks on Electionsarticle · 4 shared references 2010Towards a dichotomy for the Possible Winner problem in elections based on scoring rulesarticle · 4 shared references 2010Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electoratesother · 4 shared references 2013The complexity of manipulative attacks in nearly single-peaked electoratesarticle · 4 shared references

Details

Year2009

Typeother

Published2009-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations119

Files0 public / 0

ShelfGame Theory and Voting Systems

Identifiers

doi10.1007/978-3-642-04645-2_27

openalex_workW2913352891

Links

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