Algorithmics of Egalitarian versus Equitable Sequences of Committees

Authors: Eva Michelle Deltl, Till Fluschnik, Robert Bredereck

IJCAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We analyze the parameterized complexity of finding such committees for the parameters n, m, k, τ, x, and y, as well as combinations thereof.
Researcher Affiliation Academia Eva Michelle Deltl1 , Till Fluschnik1,2 and Robert Bredereck2 1Technische Universit at Berlin, Faculty IV, Algorithmics and Computational Complexity 2TU Clausthal, Institut f ur Informatik e.deltl@campus.tu-berlin.de, {till.fluschnik, robert.bredereck}@tu-clausthal.de
Pseudocode Yes Algorithm 1: FPT-algorithm for PE-GCSE parameterized by k + τ on input (A, C, U, (kt)t, (xt)t, (ya)a).
Open Source Code No The paper does not provide any specific links to source code repositories or statements about releasing its code.
Open Datasets No The paper is theoretical and does not involve data or datasets.
Dataset Splits No The paper is theoretical and does not involve data splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and does not involve computational experiments that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not describe software dependencies with specific version numbers for experiments.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations.