TY - CONF
AB - Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of "online leasing problems" by introducing leasing to online optimization problems. Resources required to provide a service in an "online leasing problem" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of "online resource leasing problems".
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
ID - 266
T2 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)
TI - Online Resource Leasing
ER -
TY - BOOK
ED - Gausemeier, Jürgen
ED - Grafe, Michael
ED - Meyer auf der Heide, Friedhelm
ID - 17431
TI - Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR
VL - 342
ER -
TY - JOUR
AB - Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance.
AU - Cohen, R.
AU - Polevoy, Gleb
ID - 17657
IS - 99
JF - Cloud Computing, IEEE Transactions on
KW - Approximation algorithms
KW - Approximation methods
KW - Bandwidth
KW - Cloud computing
KW - Routing
KW - Schedules
KW - Scheduling
SN - 2168-7161
TI - Inter-Datacenter Scheduling of Large Data Flows
VL - PP
ER -
TY - CONF
AB - 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 time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
ED - Dehne, Frank
ED - Sack, Jörg Rüdiger
ED - Stege, Ulrike
ID - 274
T2 - Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings
TI - Non-preemptive Scheduling on Machines with Setup Times
ER -
TY - THES
AU - Markarian, Christine
ID - 267
TI - Online Resource Leasing
ER -
TY - JOUR
AB - We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.
AU - Caragiannis, Ioannis
AU - Fanelli, Angelo
AU - Gravin, Nick
AU - Skopalik, Alexander
ID - 320
IS - 1
JF - Transactions on Economics and Computation
TI - Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
VL - 3
ER -
TY - CONF
AU - Berssenbrügge, Jan
AU - Wiederkehr, Olga
AU - Jähn, Claudius
AU - Fischer, Matthias
ID - 17425
T2 - 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
TI - Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme
VL - 343
ER -
TY - CONF
AB - Consider n nodes connected to a single coordinator. Each node receives an
individual online data stream of numbers and, at any point in time, the
coordinator has to know the k nodes currently observing the largest values, for
a given k between 1 and n. We design and analyze an algorithm that solves this
problem while bounding the amount of messages exchanged between the nodes and
the coordinator. Our algorithm employs the idea of using filters which,
intuitively speaking, leads to few messages to be sent, if the new input is
"similar" to the previous ones. The algorithm uses a number of messages that is
on expectation by a factor of O((log {\Delta} + k) log n) larger than that of
an offline algorithm that sets filters in an optimal way, where {\Delta} is
upper bounded by the largest value observed by any node.
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 16460
T2 - Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)
TI - Online Top-k-Position Monitoring of Distributed Data Streams
ER -
TY - CONF
AU - Hamann, Heiko
AU - Schmickl, Thomas
AU - Zahadat, Payam
ID - 19988
T2 - 13th European Conference on Artificial Life (ECAL 2015)
TI - Evolving Collective Behaviors With Diverse But Predictable Sensor States
ER -
TY - CONF
AU - Ding, Hongli
AU - Hamann, Heiko
ID - 19990
T2 - First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)
TI - Dependability in Swarm Robotics: Error Detection and Correction
ER -
TY - CONF
AU - Dorigo, Marco
AU - Hamann, Heiko
AU - Valentini, Gabriele
ID - 20005
T2 - Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)
TI - Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off
ER -
TY - JOUR
AB - Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS.
AU - Bar-Yehuda, Reuven
AU - Polevoy, Gleb
AU - Rawitz, Dror
ID - 17658
JF - Discrete Applied Mathematics
KW - Local ratio
SN - 0166-218X
TI - Bandwidth allocation in cellular networks with multiple interferences
VL - 194
ER -
TY - CONF
AB - We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic.
AU - Abshoff, Sebastian
AU - Cord-Landwehr, Andreas
AU - Jung, Daniel
AU - Skopalik, Alexander
ID - 395
T2 - Proceedings of the 10th International Conference on Web and Internet Economics (WINE)
TI - Multilevel Network Games
ER -
TY - CONF
AB - In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\Phi(\sf s)$ of any outcome $\sf s$ of a congestion game approximates the optimum potential value $\Phi(\sf s^*)$ by a factor $\Psi_{\mathcal{F}}$ which only depends on the set of cost/utility functions $\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\sf s$. The significance of this result is twofold. On the one hand it provides \emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\varepsilon)\cdot\Psi_{\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions.
AU - Feldotto, Matthias
AU - Gairing, Martin
AU - Skopalik, Alexander
ID - 453
T2 - Proceedings of the 10th International Conference on Web and Internet Economics (WINE)
TI - Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
ER -
TY - CONF
AB - Collective decision making in self-organized systems is challenging because it relies on local perception and local communication. Globally defined qualities such as consensus time and decision accuracy are both difficult to predict and difficult to guarantee. We present the weighted voter model which implements a self-organized collective decision making process. We provide an ODE model, a master equation model (numerically solved by the Gillespie algorithm), and agent-based simulations of the proposed decision-making strategy. This set of models enables us to investigate the system behavior in the thermodynamic limit and to investigate finite-size effects due to random fluctuations. Based on our results, we give minimum requirements to guarantee consensus on the optimal decision, a minimum swarm size to guarantee a certain accuracy, and we show that the proposed approach scales with system size and is robust to noise.
AU - Dorigo, Marco
AU - Hamann, Heiko
AU - Valentini, Gabriele
AU - Lomuscio, Alessio
AU - Scerri, Paul
AU - Bazzan, Ana
AU - Huhns, Michael
ID - 20121
T2 - Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)
TI - Self-Organized Collective Decision Making: The Weighted Voter Model
ER -
TY - CONF
AU - Hamann, Heiko
ID - 20126
T2 - Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)
TI - Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal
ER -
TY - CONF
AU - King, Thomas C.
AU - Liu, Qingzhi
AU - Polevoy, Gleb
AU - de Weerdt, Mathijs
AU - Dignum, Virginia
AU - van Riemsdijk, M. Birna
AU - Warnier, Martijn
ID - 17661
KW - crowd-sensing
KW - crowdsourcing
KW - data aggregation
KW - game theory
KW - norms
KW - reciprocation
KW - self interested agents
KW - simulation
SN - 978-1-4503-2738-1
T2 - Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems
TI - Request Driven Social Sensing
ER -
TY - CONF
AU - Polevoy, Gleb
AU - Trajanovski, Stojan
AU - de Weerdt, Mathijs M.
ID - 17659
KW - competition
KW - equilibrium
KW - market
KW - models
KW - shared effort games
KW - simulation
SN - 978-1-4503-2738-1
T2 - Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems
TI - Nash Equilibria in Shared Effort Games
ER -
TY - CONF
AB - We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.
AU - Antoniadis, Antonios
AU - Barcelo, Neal
AU - Consuegra, Mario
AU - Kling, Peer
AU - Nugent, Michael
AU - Pruhs, Kirk
AU - Scquizzato, Michele
ID - 435
T2 - Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)
TI - Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
ER -
TY - CONF
AB - In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.
AU - Kniesburges, Sebastian
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Scheideler, Christian
ID - 459
T2 - Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)
TI - Algorithmic Aspects of Resource Management in the Cloud
ER -
TY - CONF
AU - Hamann, Heiko
AU - Karsai, Istvan
AU - Schmickl, Thomas
AU - Hilbun, Allison
ID - 20007
T2 - Symposium on Biomathematics and Ecology: Education and Research
TI - The common stomach: Organizing task allocation in wasp societies
ER -
TY - CONF
AU - Birattari, Mauro
AU - Dorigo, Marco
AU - Hamann, Heiko
AU - Garnier, Simon
AU - Montes de Oca, Marco
AU - Solnon, Christine
AU - Stuetzle, Thomas
AU - Ding, Hongli
ID - 20127
T2 - Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
TI - Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation
VL - 8667
ER -
TY - JOUR
AU - Polevoy, Gleb
AU - Smorodinsky, Rann
AU - Tennenholtz, Moshe
ID - 17662
IS - 1
JF - ACM Trans. Econ. Comput.
KW - Competition
KW - efficiency
KW - equilibrium
KW - market
KW - social welfare
SN - 2167-8375
TI - Signaling Competition and Social Welfare
VL - 2
ER -
TY - THES
AB - In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems. Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen.
AU - Kling, Peter
ID - 431
TI - Energy-efficient Scheduling Algorithms
ER -
TY - CONF
AB - In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.
AU - Feldotto, Matthias
AU - Scheideler, Christian
AU - Graffi, Kalman
ID - 412
T2 - Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)
TI - HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths
ER -
TY - GEN
AU - Pahl, David
ID - 373
TI - Reputationssysteme für zusammengesetzte Dienstleistungen
ER -
TY - CONF
AB - Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}
AU - Cord-Landwehr, Andreas
AU - Mäcker, Alexander
AU - Meyer auf der Heide, Friedhelm
ID - 380
T2 - Proceedings of the 10th International Conference on Web and Internet Economics (WINE)
TI - Quality of Service in Network Creation Games
ER -
TY - CONF
AB - We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions.
AU - Hansknecht, Christoph
AU - Klimm, Max
AU - Skopalik, Alexander
ID - 455
T2 - Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
TI - Approximate pure Nash equilibria in weighted congestion games
ER -
TY - CONF
AB - We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.
AU - Feldotto, Matthias
AU - Skopalik, Alexander
ID - 462
T2 - Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)
TI - A Simulation Framework for Analyzing Complex Infinitely Repeated Games
ER -
TY - CONF
AU - Hamann, Heiko
AU - Valentini, Gabriele
ID - 20008
SN - 0302-9743
T2 - Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
TI - Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins
ER -
TY - CHAP
AU - Khaluf, Yara
AU - Dorigo, Marco
AU - Hamann, Heiko
AU - Valentini, Gabriele
AU - Bartz-Beielstein, T.
ID - 20128
T2 - 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)
TI - Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements
VL - 8672
ER -
TY - CONF
AU - Cervera, Enric
AU - Khaluf, Yara
AU - Birattari, Mauro
AU - Hamann, Heiko
AU - Pobil, Angel P. del
AU - Chinellato, Eris
AU - Martinez-Martin, Ester
AU - Hallam, John
AU - Morales, Antonio
ID - 20130
T2 - Simulation of Adaptive Behavior (SAB 2014)
TI - A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs
VL - 8575
ER -
TY - CHAP
AU - Lukovszki, Tamás
AU - Meyer auf der Heide, Friedhelm
ID - 16394
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
ER -
TY - BOOK
ED - Flocchini, Paola
ED - Gao, Jie
ED - Kranakis, Evangelos
ED - Meyer auf der Heide, Friedhelm
ID - 16870
SN - 0302-9743
TI - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013
VL - 8243
ER -
TY - CONF
AB - In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.
AU - Abshoff, Sebastian
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
ID - 379
T2 - Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Randomized Online Algorithms for Set Cover Leasing Problems
ER -
TY - CONF
AB - We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to be shared between the tasks. We study strategic budget games, where the budget is shared proportionally. We also consider a variant in which the order of the strategic decisions influences the distribution of the budgets. The complexity of the optimal solution as well as existence, complexity and quality of equilibria are analysed. Finally, we show that the time an ordered budget game needs to convergence towards an equilibrium may be exponential.
AU - Drees, Maximilian
AU - Riechers, Sören
AU - Skopalik, Alexander
ED - Lavi, Ron
ID - 451
T2 - Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)
TI - Budget-restricted utility games with ordered strategic decisions
ER -
TY - CONF
AB - We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19].
AU - Gairing, Martin
AU - Kotsialou, Grammateia
AU - Skopalik, Alexander
ID - 456
T2 - Proceedings of the 10th International Conference on Web and Internet Economics (WINE)
TI - Approximate pure Nash equilibria in Social Context Congestion Games
ER -
TY - CONF
AU - Hamann, Heiko
AU - Sayama, Hiroki
AU - Rieffel, John
AU - Risi, Sebastian
AU - Doursat, Rene
AU - Lipson, Hod
ID - 20129
T2 - 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)
TI - Evolution of Collective Behaviors by Minimizing Surprise
ER -
TY - CHAP
AU - Abshoff, Sebastian
AU - Meyer auf der Heide, Friedhelm
ID - 16395
SN - 0302-9743
T2 - Structural Information and Communication Complexity
TI - Continuous Aggregation in Dynamic Ad-Hoc Networks
ER -
TY - CONF
AB - We consider the problem of scheduling a number of jobs on $m$ identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement r_j \in {0,1}. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their \emph{processing speeds}, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature.In this paper, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover, we prove that balanced schedules yield a 2-1/m-approximation for a fixed number of processors. Such schedules are computed by our GreedyBalance algorithm, for which the bound is tight.
AU - Brinkmann, Andre
AU - Kling, Peter
AU - Meyer auf der Heide, Friedhelm
AU - Nagel, Lars
AU - Riechers, Sören
AU - Süss, Tim
ID - 368
T2 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Scheduling Shared Continuous Resources on Many-Cores
ER -
TY - CONF
AB - Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived.
AU - Harks, Tobias
AU - Höfer, Martin
AU - Schewior, Kevin
AU - Skopalik, Alexander
ID - 370
T2 - Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)
TI - Routing Games with Progressive Filling
ER -
TY - CONF
AB - Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \alpha > 0, if it decides to be a gateway. For both games and different ranges of \alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics.
AU - Abshoff, Sebastian
AU - Cord-Landwehr, Andreas
AU - Jung, Daniel
AU - Skopalik, Alexander
ED - Lavi, Ron
ID - 452
T2 - Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)
TI - Brief Announcement: A Model for Multilevel Network Games
ER -
TY - THES
AU - Petring, Ralf
ID - 19039
TI - Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit
ER -
TY - JOUR
AB - A grand challenge in the field of artificial life is to find a general theory of emergent self-organizing systems. In swarm systems most of the observed complexity is based on motion of simple entities. Similarly, statistical mechanics focuses on collective properties induced by the motion of many interacting particles. In this article we apply methods from statistical mechanics to swarm systems. We try to explain the emergent behavior of a simulated swarm by applying methods based on the fluctuation theorem. Empirical results indicate that swarms are able to produce negative entropy within an isolated subsystem due to frozen accidents. Individuals of a swarm are able to locally detect fluctuations of the global entropy measure and store them, if they are negative entropy productions. By accumulating these stored fluctuations over time the swarm as a whole is producing negative entropy and the system ends up in an ordered state. We claim that this indicates the existence of an inverted fluctuation theorem for emergent self-organizing dissipative systems. This approach bears the potential of general applicability.
AU - Hamann, Heiko
AU - Schmickl, Thomas
AU - Crailsheim, Karl
ID - 20120
IS - 1
JF - Artificial Life
TI - Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem
VL - 20
ER -
TY - CONF
AU - Polevoy, Gleb
AU - de Weerdt, Mathijs M.
ID - 17660
KW - dynamics
KW - emotion modeling
KW - negotiation
KW - network interaction
KW - shared effort game
SN - 978-1-4503-2738-1
T2 - Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems
TI - Improving Human Interaction in Crowdsensing
ER -
TY - CONF
AB - We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.
AU - Abshoff, Sebastian
AU - Benter, Markus
AU - Cord-Landwehr, Andreas
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 477
T2 - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
TI - Token Dissemination in Geometric Dynamic Networks
ER -
TY - THES
AU - Eikel, Benjamin
ID - 17440
TI - Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes
ER -
TY - CONF
AB - In this paper we introduce “On-The-Fly Computing”, our vision of future IT services that will be provided by assembling modular software components available on world-wide markets. After suitable components have been found, they are automatically integrated, configured and brought to execution in an On-The-Fly Compute Center. We envision that these future compute centers will continue to leverage three current trends in large scale computing which are an increasing amount of parallel processing, a trend to use heterogeneous computing resources, and—in the light of rising energy cost—energy-efficiency as a primary goal in the design and operation of computing systems. In this paper, we point out three research challenges and our current work in these areas.
AU - Happe, Markus
AU - Kling, Peter
AU - Plessl, Christian
AU - Platzner, Marco
AU - Meyer auf der Heide, Friedhelm
ID - 505
T2 - Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS)
TI - On-The-Fly Computing: A Novel Paradigm for Individualized IT Services
ER -
TY - GEN
AB - We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.
AU - Meyer auf der Heide, Friedhelm
AU - Swirkot, Kamil
ID - 524
TI - Hierarchies in Local Distributed Decision
ER -
TY - CONF
AB - In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.
AU - Keller, Matthias
AU - Pawlik, Stefan
AU - Pietrzyk, Peter
AU - Karl, Holger
ID - 562
T2 - Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing
TI - A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
ER -