Studies in Computational Aspects of Voting (Q2908543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of social choice and welfare. Vol. 1. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of crossings in permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Kernelization for Rank Aggregation: Theory and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy for the possible winner problem in elections based on scoring rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Approval Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problem Kernels for Possible Winner Determination under the k-Approval Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for Kemeny rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average parameterization and partial kernelization for computing medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of Dodgson and Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of Fully Proportional Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of candidate control in elections and related digraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice classes of parametrized tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Introduction to Computational Social Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of lobbying in multiple referenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New candidates welcome! Possible winners with respect to the addition of new candidates / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate complexity analysis of Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confronting intractability via parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Probabilistic Lobbying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control complexity in Bucklin and fallback voting: an experimental analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic technique for multi-agent planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Drawing in Subexponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimode Control Attacks on Elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Richer Understanding of the Complexity of Election Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet Social Choice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the winner of a Dodgson election is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Compression for Exactly Solving NP-Hard Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anyone but him: the complexity of precluding an alternative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of control problems in voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of control problems in Maximin election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompleteness and incomparability in preference aggregation: complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of achieving proportional representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of the winner problem for Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Campaign management under approval-driven voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for the Kemeny Aggregation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Decision Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Possible and Necessary Winners Given Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Consistent Extension of Condorcet’s Election Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Condorcet's rule / rank
 
Normal rank

Latest revision as of 15:13, 5 July 2024

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

    Statements

    Studies in Computational Aspects of Voting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers