Publikationen

 

Unser Lehrstuhl besteht seit September 2013. Publikationen aus der Zeit vor der Entstehung des Lehrstuhls befinden sich auf der jeweiligen Seite der Teammitarbeiterin oder des Teammitarbeiters.

 

Publikationen

V. Ravindran Vijayalakshmi
Selfishness in Strategic Resource Allocation Problems
Dissertation, RWTH Aachen University, 2021
B. Peis, M. Schröder, K. Jungnitsch
Stackelberg Max Closure with Multiple Followers
Mathematics of Operations Research, 2022
B.Peis, S.T. McCormick, R. Scheidweiler und F. Vallentin
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
SIAM Journal of Discrete Mathematics Vol. 35 No. 4, pp. 2345-2356, 2021
B. Peis, S. Lendl und V. Timmermans
Matroid Bases with Cardinality Constraints on the Intersection
Mathematical Programming Series A, 2021
V. Ravindran Vijayalakshmi, A. Skopalik
Improving Approximate Pure Nash Equilibria in Congestion Games
WINE 2020
M. Schröder, T. Tamir, V. Ravindran Vijayalakshmi
Scheduling games with machine-dependent priority lists
Theoretical computer science 855
B. Tauer
The Impact of Coordination within Transportation Networks
Dissertation, RWTH Aachen University, 2020
L. Vargas Koch
Competitive Variants of Discrete and Continuous Flows over Time
Dissertation, RWTH Aachen University, 2020
O. Antons, J.C. Arlinghaus
Learning Distributed Control for Job Shops - A Comparative Simulation Study
Service Oriented, Holonic and Multi-Agent Manufacturing Systems for Industry of the Future, 2020
O. Antons, J.C. Arlinghaus
Designing decision-making authorities for smart factories
53rd CIRP Conference on Manufacturing Systems 2020
O. Antons, J.C. Arlinghaus
Management für Digitalisierung und Industrie 4.0
Handbuch Industrie 4.0: Recht, Technik, Gesellschaft, pp. 1121-1145 (2020)
O. Antons, J.C. Arlinghaus
Modelling Autonomous Production Control: A Guide to Select the Most Suitable Modelling Approach
Internation Conference on Dynamics in Logistics, pp. 245-253 (2020)
O. Antons, Z. Zhao and J.C. Arlinghaus

Autonomous Production Control Methods-Job Shop Simulations
International Conference on Dynamics in Logistics, pp. 227-235 (2020)

M. Schröder
Price of anarchy in congestion games with altruistic/spiteful players
Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT 2020)

L. Vargas Koch, B. Tauer, D. Fischer, J. Fuchs, S. Zieger
Waiting for Trains: Complexity Results

Conference on Algorithms and Discrete Applied Mathematics. Springer, Cham, 2020

L. Vargas Koch, T. Ziemke, L. Sering, M. Zimmer, K. Nagel, M. Skutella
Flows Over Time as Continuous Limits of Packet-Based Network Simulations

Transportation Research Procedia 52 (2021): 123-130.

J. Correa, C. Guzman, T. Lianeas, E. Nikolova und M. Schröder:
Network pricing: how to induce optimal flows under strategic link operators
Accepted, Operations Research (2020).
B. Tauer, J. Dreier, J. Fuchs, T.A. Hartmann, P. Kuinke, P. Rossmanith, H. Wang
The Complexity of Packing Edge-Disjoint Paths
IPEC 2019
T. Götte, V. Ravindran Vijayalakshmi und C. Scheideler:
Always be Two Steps Ahead of Your Enemy
IEEE International Parallel and Distributed Processing Symposium (IPDPS 2019).
V. Ravindran Vijayalakshmi, M. Schröder und T. Tamir:
Scheduling Games with Machine-Dependent Priority Lists
Proceedings of the 15th International Conference on Web and Internet Economics (WINE 2019).
R. Cominetti, M. Scarsini, M. Schröder und N. Stier-Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs
Proceedings of the 2019 ACM Conference on Economics and Computation (EC'19).
D. Schmand, M. Schröder und A. Skopalik:
Network Investment Games with Wardrop Followers
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).
T. Harks, M. Schröder und D. Vermeulen:
Toll Caps in Privatized Road Networks
European Journal of Operational Research, 276 (3), pp. 947-956 (2019).
B. Peis, K. Chandrasekaran, C. Gottschalk, J. Könemann, D. Schmand und A. Wierz:
Additive Stabilizers for Unstable Graphs
Discrete Optimization 31, pp. 56-78, 2019
M. Groß, M. E. Pfetsch, L. Schewe, M. Schmidt, M. Skutella:
Algorithmic results for potential-based flows: Easy and hard cases
Networks, 73(3), pp. 306-324 (2019).
R. Burlacu, H. Egger, M. Groß, A. Martin, M. E. Pfetsch, L. Schewe, M. Sirvent, M. Skutella:
Maximizing the storage capacity of gas networks: a global MINLP approach
Optimization and Engineering 20 (2), pp. 543-57 (2019).
I. O. Bercea, M. Groß, S. Khuller, A. Kumar, C. Rösner, D. R. Schmidt, M. Schmidt:
On the cost of essentially fair clusterings
CoRR abs/1811.10319 (2018).
M. Groß, M. E. Pfetsch, M. Skutella:
On the complexity of instationary gas flows
Operations Research Letters, 46(3), pp. 286-290 (2018).
S. Fiorini, M. Groß, J. Könemann, L. Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018).
M. Groß, A. Gupta, A. Kumar, J. Matuschke, D. R. Schmidt, M. Schmidt, J. Verschae:
A Local-Search Algorithm for Steiner Forest
Leibniz International Proceedings in Informatics (2018).
A. Arulselvan, Á. Cseh, M. Groß, D. F. Manlove, J. Matuschke:
Matchings with Lower Quotas: Algorithms and Complexity
Algorithmica 80(1), pp. 185-208 (2018)

L. Sering und L. Vargas Koch:
Nash Flows over Time with Spillback
Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019).

M. Strehler, R. Schefler und L. Vargas Koch:
Equilibria in Routing Games with Edge Priorities
Proceedings of the 14th International Conference on Web and Internet Economics (WINE 2018).
J. Correa, R. Hoeksma und M. Schröder:
Network congestion games are robust to variable demand
Transportation Research Part B: Methodological, 119, pp.69-78 (2019).
H. Peters, M. Schröder und D. Vermeulen:
Claim Games for Estate Division Problems
Games and Economic Behavior, 116, 105-115 (2019).
K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand und A. Wierz:
Additive Stabilizers for Unstable Graphs
Discrete Optimization, 31, pp. 56-78 (2019).
T. Harks und V. Timmermans:
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
Journal of Combinatorial Optimization, 36 (3), pp. 812-830 (2018).
B. Peis, B. Tauer, V. Timmermans und L. Vargas Koch:
Oligopolistic Competitive Packet Routing
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 13:1-13:22 (2018).

T. Harks, M. Klimm und B. Peis:
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids
SIAM Jounal on Optimization, 28 (3), pp. 2222–2245 (2018).

T. Harks, B. Peis, D. Schmand, B. Tauer und L. Vargas Koch:
Competitive Packet Routing with Priority Lists
ACM Transactions on Econonimcs and Computation, 6 (1), p. 4 (2018).

J. Correa, C. Guzman, T. Lianeas, E. Nikolova und M. Schröder:
Network pricing: how to induce optimal flows under strategic link operators
Proceedings of the 19th ACM conference on Economics and Computation (EC’18), pp. 375-392 (2018).

H. Peters, M. Schröder und D. Vermeulen:
Hotelling's location model with negative network externalities
International Journal of Game Theory, 47 (3), pp. 811-837 (2018).

M. Scarsini, M. Schröder und T. Tomala:
Dynamic atomic congestion games with seasonal flows
Operations Research, 66 (2), pp. 327-339 (2018).

T. Harks und V. Timmermans:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games
Proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 442-454 (2017).

J. Correa, R. Hoeksma und M. Schröder:
Network congestion games are robust to variable demand
Proceedings of the 13th International Conference on Web and Internet Economics (WINE), p. 397 (2017).

C. Gottschalk, A. M. C. A. Koster, F. Liers, B. Peis, D. Schmand und A. Wierz:
Robust Flows over Time: Models and Complexity Results
Mathematical Programming, 171 (1-2), pp. 1-31 (2017).
U. Faigle, W. Kern und B. Peis:
Greedy Oriented Flows
Algorithmica, 80 (4), pp. 1-17 (2017).

A. Bjelde, M. Klimm und D. Schmand:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 227-229 (2017).

J. Matuschke, S.T. McCormick, G. Oriolo, B. Peis und M. Skutella:
Protection of flows under targeted attacks
Operations Research Letters, 45 (1), pp. 53-59 (2017).

O. Schaudt und V. Weil:
On bounding the difference between the maximum degree and the chromatic number by a constant
Discrete Applied Mathematics, 231, pp. 228-234 (2017).
S. Fujishige, M.X. Goemans, T. Harks, B. Peis und R. Zenklusen:
Matroids are immune to Braess paradox
Mathematics of Operations Research, 42 (3), pp. 745-761 (2017).
S.T. McCormick, B. Peis, J. Verschae und A. Wierz:
Primal–Dual Algorithms for Precedence Constrained Covering Problems
Algorithmica (2016).
C. Gottschalk, H. Lüthen, B. Peis und A. Wierz:
Optimization Problems with Color-Induced Budget Constraints
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO), pp. 189-200 (2016).
T. Harks, D. Schmand, B. Peis und L. Vargas Koch:
Competitive Packet Routing with Priority Lists
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 49:1-49:14 (2016).
C. Gottschalk und J. Vygen:
Better s-t-Tours by Gao Trees
Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 126-137 (2016).

A. Bock, K. Chandrasekaran, J. Könemann, B. Peis und L. Sanità:
Finding small stabilizers for unstable graphs
Mathematical Programming, 154 (1-2), pp. 173-196 (2015).

S. Fujishige, M. X. Goemans, T. Harks, B. Peis und R. Zenklusen:
Congestion games viewed from M-convexity
Operations Research Letters, 43 (3), pp. 329-333 (2015).
M. Klimm und D. Schmand:
Sharing Non-anonymous Costs of Multiple Resources Optimally
Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287 (2015).
C. Gottschalk und B. Peis:
Submodular Function Maximization on the Bounded Integer Lattice
Proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA), pp. 133-144 (2015).
T. Harks und B. Peis:
Resource Buying Games
Algorithmica, 70 (3), pp. 493-512 (2014).
J. W. Kappmeier, J. Matuschke und B. Peis:
Abstract flows over time: A first step towards solving dynamic packing problems
Theoretical Computer Science, 544, pp. 74-83 (2014).
A. Wierz, P. Beis und S. T. McCormick:
Primal-Dual Algorithms for Precedence Constrained Covering Problems
Proceedings of the 12th International Workshop on Approximation and Online Algorithms (WAOA), pp. 260-272 (2014).
T. Harks, M. Klimm und B. Peis:
Resource Competition on Integral Polymatroids
Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182-202 (2014).

 

Preprints

K. Eickhoff, S.T. McCormick, B. Peis, N. Rieken, L. Vargas Koch
Computing buyer-optimal Walrasian prices in multi-unit matching markets via a sequence of max flow computations
preprint (2021).

K. Jungnistch, B. Peis, M. Schröder
Stackelberg Max Weight Closure with Multiple Followers
preprint (2020).

J. Verschae, B. Peis und A. Wierz:
The Primal-Dual Greedy Algorithm for Weighted Covering Problems
preprint (2017).

Y. Disser, J. Fearnley, M. Gairing, O. Göbel, M. Klimm, D. Schmand, A. Skopalik und A. Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment
preprint (2016).

F. Mies and B. Peis und A. Wierz:
Computational Methods for Path-Based Robust Flows
preprint (2016).
V. Weil
A note on Reed's Conjecture about ω, Δ and χ with respect to vertices of high degree
preprint (2016).