13 citations · 15 across the 3 of their papers we have counts for
4 papers
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos +2
We study the existence of approximate pure Nash equilibria (-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree . Previously it was kno…
Budget Minimization with Precedence Constraints
Marinus Gottschau, Felix Happach, Marcus Kaiser +1
Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs . A job is available f…
The Undirected Two Disjoint Shortest Paths Problem
Marinus Gottschau, Marcus Kaiser, Clara Waldmann
The disjoint shortest paths problem (-DSPP) on a graph with source-sink pairs asks for the existence of pairwise edge- or vertex-disjoint shortest …
Index appearance record for transforming Rabin automata into parity automata
Jan Křetínský, Tobias Meggendorfer, Clara Waldmann +1
Transforming deterministic -automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this a…