Approximation and Parameterized Complexity of Minimax Approval Voting

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.1.11253
Full Text
Abstract

Available in full text

Date
Authors
Publisher

AI Access Foundation

Related search

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Multiwinner Approval Voting: An Apportionment Approach

Public Choice
SociologyEconomicsEconometricsPolitical Science
2018English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On the Manipulability of Approval Voting and Related Scoring Rules

Social Choice and Welfare
EconomicsSocial SciencesEconometrics
2011English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2020English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

The Parameterized Complexity of the Shared Center Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy