TY - CONF
AB - We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.
AU - Feldotto, Matthias
AU - Leder, Lennart
AU - Skopalik, Alexander
ID - 112
T2 - Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)
TI - Congestion Games with Complementarities
ER -
TY - CONF
AB - In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren.
AU - Brandt, Sascha
AU - Fischer, Matthias
ID - 16339
T2 - Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017
TI - Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell
VL - 369
ER -
TY - CHAP
AU - Bemmann, Pascal
AU - Biermeier, Felix
AU - Bürmann, Jan
AU - Kemper, Arne
AU - Knollmann, Till
AU - Knorr, Steffen
AU - Kothe, Nils
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
AU - Schaefer, Johannes
AU - Sundermeier, Jannik
ID - 16461
SN - 0302-9743
T2 - Structural Information and Communication Complexity
TI - Monitoring of Domain-Related Problems in Distributed Data Streams
ER -
TY - CONF
AB - We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed).
AU - Kling, Peter
AU - Mäcker, Alexander
AU - Riechers, Sören
AU - Skopalik, Alexander
ID - 59
T2 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource
ER -
TY - CONF
AB - In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.
AU - Drees, Maximilian
AU - Feldotto, Matthias
AU - Riechers, Sören
AU - Skopalik, Alexander
ID - 66
T2 - Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)
TI - Pure Nash Equilibria in Restricted Budget Games
ER -
TY - JOUR
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
ID - 706
IS - 4
JF - Journal of Combinatorial Optimization
TI - Cost-efficient Scheduling on Machines from the Cloud
VL - 36
ER -
TY - GEN
AU - Bürmann, Jan
ID - 1080
TI - Complexity of Signalling in Routing Games under Uncertainty
ER -
TY - GEN
AU - Nachtigall, Simon
ID - 1073
TI - Sortieren dynamischer Daten
ER -
TY - CONF
AB - We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].
AU - Feldotto, Matthias
AU - Gairing, Martin
AU - Kotsialou, Grammateia
AU - Skopalik, Alexander
ID - 113
T2 - Proceedings of the 13th International Conference on Web and Internet Economics (WINE)
TI - Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
ER -
TY - CONF
AU - Fischer, Matthias
AU - Jung, Daniel
AU - Meyer auf der Heide, Friedhelm
ED - Fernández Anta, Antonio
ED - Jurdzinski, Tomasz
ED - Mosteiro, Miguel A.
ED - Zhang, Yanyong
ID - 16347
T2 - Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}
TI - Gathering Anonymous, Oblivious Robots on a Grid
VL - 10718
ER -
TY - CONF
AB - We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence.
AU - Feldkord, Björn
AU - Meyer auf der Heide, Friedhelm
ID - 55
T2 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - The Mobile Server Problem
ER -
TY - CONF
AB - Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
ID - 79
T2 - Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)
TI - Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
VL - 10787
ER -
TY - GEN
AU - Vijayalakshmi, Vipin Ravindran
ID - 1081
TI - Bounding the Inefficiency of Equilibria in Congestion Games under Taxation
ER -
TY - GEN
AU - Pukrop, Simon
ID - 1074
TI - Robuste Optimierung in Congestion Games
ER -
TY - CONF
AU - Biermeier, Felix
AU - Feldkord, Björn
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 16348
T2 - Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)
TI - A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries
ER -
TY - CONF
AU - Markarian, Christine
ID - 2851
T2 - International Conference on Operations Research (OR)
TI - Leasing with Uncertainty
ER -
TY - JOUR
AU - Althaus, Ernst
AU - Brinkmann, Andre
AU - Kling, Peter
AU - Meyer auf der Heide, Friedhelm
AU - Nagel, Lars
AU - Riechers, Sören
AU - Sgall, Jiri
AU - Suess, Tim
ID - 63
JF - Journal of Scheduling
TI - Scheduling Shared Continuous Resources on Many-Cores
ER -
TY - GEN
AU - Nowack, Joshua
ID - 695
TI - On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen
ER -
TY - CONF
AU - Feldkord, Björn
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
ID - 70
T2 - Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Price Fluctuations in Online Leasing
ER -
TY - THES
AU - Podlipyan, Pavel
ID - 703
TI - Local Algorithms for the Continuous Gathering Problem
ER -