Studies in Computational Aspects of Voting (Q2908543)

From MaRDI portal

Revision as of 15:13, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Studies in Computational Aspects of Voting	scientific article

Statements

scholarly article

0 references

Studies in Computational Aspects of Voting (English)

0 references

0 references

Robert Bredereck

0 references

0 references

Rolf Niedermeier

0 references

The Multivariate Algorithmic Revolution and Beyond

0 references

publication date

5 September 2012

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-30891-8_16

0 references

Computational Complexity

0 references

Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists

0 references

0 references

Handbook of social choice and welfare. Vol. 1.

0 references

0 references

Sophisticated voting outcomes and agenda control

0 references

On the complexity of crossings in permutations

0 references

Partial Kernelization for Rank Aggregation: Theory and Experiments

0 references

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

0 references

On bounded-degree vertex deletion parameterized by treewidth

0 references

Towards a dichotomy for the possible winner problem in elections based on scoring rules

0 references

On problems without polynomial kernels

0 references

Computational Aspects of Approval Voting

0 references

On Problem Kernels for Possible Winner Determination under the k-Approval Protocol

0 references

Fixed-parameter algorithms for Kemeny rankings

0 references

Average parameterization and partial kernelization for computing medians

0 references

Parameterized computational complexity of Dodgson and Young elections

0 references

Single transferable vote resists strategic voting

0 references

Kernelization: New Upper and Lower Bound Techniques

0 references

0 references

On the Computation of Fully Proportional Representation

0 references

The computational difficulty of manipulating an election

0 references

Voting schemes for which it can be difficult to tell who won the election

0 references

How hard is it to control an election?

0 references

Kernel bounds for disjoint cycles and disjoint paths

0 references

Parameterized complexity of candidate control in elections and related digraph problems

0 references

Advice classes of parametrized tractability

0 references

A Short Introduction to Computational Social Choice

0 references

On complexity of lobbying in multiple referenda

0 references

0 references

New candidates welcome! Possible winners with respect to the addition of new candidates

0 references

When are elections with few candidates hard to manipulate?

0 references

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules

0 references

Incompressibility through Colors and IDs

0 references

Multivariate complexity analysis of Swap Bribery

0 references

Confronting intractability via parameters

0 references

The Complexity of Probabilistic Lobbying

0 references

Control complexity in Bucklin and fallback voting: an experimental analysis

0 references

0 references

0 references

Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control

0 references

A heuristic technique for multi-agent planning

0 references

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology

0 references

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

0 references

Ranking and Drawing in Subexponential Time

0 references

How Hard Is Bribery in Elections?

0 references

Multimode Control Attacks on Elections

0 references

A Richer Understanding of the Complexity of Election Systems

0 references

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control

0 references

Condorcet Social Choice Functions

0 references

Determining the winner of a Dodgson election is hard

0 references

Infeasibility of instance compression and succinct PCPs for NP

0 references

0 references

Manipulation of Voting Schemes: A General Result

0 references

Iterative Compression for Exactly Solving NP-Hard Minimization Problems

0 references

Exact analysis of Dodgson elections

0 references

Anyone but him: the complexity of precluding an alternative

0 references

Hybrid Elections Broaden Complexity-Theoretic Resistance to Control

0 references

The complexity of Kemeny elections

0 references

A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger

0 references

On the complexity of \(k\)-SAT

0 references

Which problems have strongly exponential complexity?

0 references

Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

0 references

Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament

0 references

Integer Programming with a Fixed Number of Variables

0 references

Parameterized computational complexity of control problems in voting systems

0 references

Parameterized complexity of control problems in Maximin election

0 references

0 references

Parameterizing above Guaranteed Values: MaxSat and MaxCut

0 references

Parameterizing above or below guaranteed values

0 references

Lower bounds on kernelization

0 references

0 references

Reflections on Multivariate Algorithmics and Problem Parameterization

0 references

0 references

Incompleteness and incomparability in preference aggregation: complexity results

0 references

On the complexity of achieving proportional representation

0 references

Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG

0 references

Exact complexity of the winner problem for Young elections

0 references

Finding odd cycle transversals.

0 references

Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions

0 references

Campaign management under approval-driven voting rules

0 references

Improved Parameterized Algorithms for the Kemeny Aggregation Problem

0 references

0 references

Statistical Decision Functions

0 references

Banks winners in tournaments are difficult to recognize

0 references

Determining Possible and Necessary Winners Given Partial Orders

0 references

A Consistent Extension of Condorcet’s Election Principle

0 references

Extending Condorcet's rule

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-30891-8_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2908543

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2908543&oldid=35297029"