On the fixed-parameter tractability of composition-consistent tournament solutions

Felix Brandt, Markus Brill, Hans Georg Seedig

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a non-empty subset of the alternatives, play an important role within social choice theory and the mathematical social sciences at large. Laffond et al. have shown that various tournament solutions satisfy composition-consistency, a structural invariance property based on the similarity of alternatives. We define the decomposition degree of a tournament as a parameter that reflects its decomposability and show that computing any composition-consistent tournament solution is fixed-parameter tractable with respect to the decomposition degree. Furthermore, we experimentally investigate the decomposition degree of two natural distributions of tournaments and its impact on the running time of computing the tournament equilibrium set.

Original languageEnglish
Title of host publicationIJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pages85-90
Number of pages6
DOIs
StatePublished - 2011
Event22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
Duration: 16 Jul 201122 Jul 2011

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Conference

Conference22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
Country/TerritorySpain
CityBarcelona, Catalonia
Period16/07/1122/07/11

Fingerprint

Dive into the research topics of 'On the fixed-parameter tractability of composition-consistent tournament solutions'. Together they form a unique fingerprint.

Cite this