16 citations · 29 across the 19 of their papers we have counts for
5 papers · 1 filter
Multi-Leader Congestion Games with an Adversary
Tobias Harks, Mona Henle, Max Klimm +2
We study a multi-leader single-follower congestion game where multiple users (leaders) choose one resource out of a set of resources and, after observing the realized loads, an adv…
A Constant-Factor Approximation for Generalized Malleable Scheduling under -Concave Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required proc…
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed s…
The popular assignment problem: when cardinality is more important than popularity
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
We consider a matching problem in a bipartite graph where nodes in are agents having preferences in partial order over their neighbors, while nodes in are o…
Bifactor Approximation for Location Routing with Vehicle and Facility Capacities
Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke
Location Routing is a fundamental planning problem in logistics, in which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.…