5 citations · 11 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.GT2015★ 5 cited
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
Maximilian Drees, Matthias Feldotto, Sören Riechers +1
In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands,…
cs.DS2015
Non-Preemptive Scheduling on Machines with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s tim…