Search Results for author: Jannik Peters

Found 4 papers, 1 papers with code

Proportional Fairness in Clustering: A Social Choice Perspective

no code implementations27 Oct 2023 Leon Kellerhals, Jannik Peters

We show that any clustering satisfying a weak proportionality notion of Brill and Peters [EC'23] simultaneously obtains the best known approximations to the proportional fairness notion of Chen et al. [ICML'19], but also to individual fairness [Jung et al., FORC'20] and the "core" [Li et al. ICML'21].

Clustering Fairness

schlably: A Python Framework for Deep Reinforcement Learning Based Scheduling Experiments

1 code implementation10 Jan 2023 Constantin Waubert de Puiseau, Jannik Peters, Christian Dörpelkus, Hasan Tercan, Tobias Meisen

Research on deep reinforcement learning (DRL) based production scheduling (PS) has gained a lot of attention in recent years, primarily due to the high demand for optimizing scheduling problems in diverse industry settings.

Job Shop Scheduling reinforcement-learning +2

Maps for Learning Indexable Classes

no code implementations15 Oct 2020 Julian Berger, Maximilian Böther, Vanja Doskoč, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger

We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned.

Learning Languages with Decidable Hypotheses

no code implementations15 Oct 2020 Julian Berger, Maximilian Böther, Vanja Doskoč, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger

This so-called $W$-index allows for naming arbitrary computably enumerable languages, with the drawback that even the membership problem is undecidable.

Cannot find the paper you are looking for? You can Submit a new open access paper.