@inproceedings{275, abstract = {{We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.}}, author = {{Cord-Landwehr, Andreas and Lenzner, Pascal}}, booktitle = {{Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}}, pages = {{248----260}}, title = {{{Network Creation Games: Think Global - Act Local}}}, doi = {{10.1007/978-3-662-48054-0_21}}, year = {{2015}}, } @misc{277, author = {{Kothe, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}}}, year = {{2015}}, } @inproceedings{17425, author = {{Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{65--78}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}}}, volume = {{343}}, year = {{2015}}, } @inproceedings{17427, author = {{Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{107--120}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}}}, volume = {{342}}, year = {{2015}}, } @book{17431, editor = {{Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide, Friedhelm}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}}}, volume = {{342}}, year = {{2015}}, } @article{17657, abstract = {{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.}}, author = {{Cohen, R. and Polevoy, Gleb}}, issn = {{2168-7161}}, journal = {{Cloud Computing, IEEE Transactions on}}, keywords = {{Approximation algorithms, Approximation methods, Bandwidth, Cloud computing, Routing, Schedules, Scheduling}}, number = {{99}}, pages = {{1--1}}, title = {{{Inter-Datacenter Scheduling of Large Data Flows}}}, doi = {{10.1109/TCC.2015.2487964}}, volume = {{PP}}, year = {{2015}}, } @article{17658, abstract = {{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. }}, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics }}, keywords = {{Local ratio}}, pages = {{23 -- 36}}, publisher = {{Elsevier}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, doi = {{http://dx.doi.org/10.1016/j.dam.2015.05.013}}, volume = {{194}}, year = {{2015}}, } @inproceedings{240, abstract = {{We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem.}}, author = {{Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}}, pages = {{277----288}}, title = {{{Towards Flexible Demands in Online Leasing Problems}}}, doi = {{10.1007/978-3-319-21398-9_22}}, year = {{2015}}, } @unpublished{16449, abstract = {{We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of $n$ indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a $2\times 2$ subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, \ldots). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the \emph{viewing path length}. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous $\mathcal{FSYNC}$ model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes the result from \cite{hopper}, where an open chain with specified distinguishable (and fixed) endpoints is considered.}}, author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{arXiv:1510.05454}}, title = {{{Gathering a Closed Chain of Robots on a Grid}}}, year = {{2015}}, } @unpublished{16452, abstract = {{We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. Distributed algorithms for this problem are of practical significance due to the dynamic nature of ad-hoc networks. We present a first distributed approximation algorithm, with a constant approximation factor and O(Diam) running time, where Diam is the diameter of the graph. Moreover we present a simple heuristic algorithm and conduct an extensive simulation study showing that our heuristic outperforms previously known approaches for the problem.}}, author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, booktitle = {{arXiv:1510.01866}}, title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks}}}, year = {{2015}}, } @inproceedings{16460, abstract = {{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.}}, author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{357--364}}, publisher = {{IEEE}}, title = {{{Online Top-k-Position Monitoring of Distributed Data Streams}}}, doi = {{10.1109/IPDPS.2015.40}}, year = {{2015}}, } @article{16391, author = {{Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}}, issn = {{2329-4949}}, journal = {{ACM Transactions on Parallel Computing}}, pages = {{1--18}}, title = {{{Linear and Competitive Strategies for Continuous Robot Formation Problems}}}, doi = {{10.1145/2742341}}, year = {{2015}}, } @unpublished{16397, abstract = {{In the gathering problem, n autonomous robots have to meet on a single point. We consider the gathering of a closed chain of point-shaped, anonymous robots on a grid. The robots only have local knowledge about a constant number of neighboring robots along the chain in both directions. Actions are performed in the fully synchronous time model FSYNC. Every robot has a limited memory that may contain one timestamp of the global clock, also visible to its direct neighbors. In this synchronous time model, there is no limited view gathering algorithm known to perform better than in quadratic runtime. The configurations that show the quadratic lower bound are closed chains. In this paper, we present the first sub-quadratic---in fact linear time---gathering algorithm for closed chains on a grid.}}, author = {{Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{ArXiv: 1501.04877}}, title = {{{Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case}}}, year = {{2015}}, } @inproceedings{20007, author = {{Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas and Hilbun, Allison}}, booktitle = {{Symposium on Biomathematics and Ecology: Education and Research}}, title = {{{The common stomach: Organizing task allocation in wasp societies}}}, year = {{2014}}, } @inproceedings{20008, author = {{Hamann, Heiko and Valentini, Gabriele}}, booktitle = {{Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}}, isbn = {{9783319099514}}, issn = {{0302-9743}}, title = {{{Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins}}}, doi = {{10.1007/978-3-319-09952-1_15}}, year = {{2014}}, } @article{20120, abstract = {{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.}}, author = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}}, journal = {{Artificial Life}}, number = {{1}}, pages = {{77--93}}, title = {{{Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem}}}, doi = {{10.1162/ARTL_a_00097}}, volume = {{20}}, year = {{2014}}, } @inproceedings{20121, abstract = {{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.}}, author = {{Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Lomuscio, Alessio and Scerri, Paul and Bazzan, Ana and Huhns, Michael}}, booktitle = {{Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)}}, title = {{{Self-Organized Collective Decision Making: The Weighted Voter Model}}}, year = {{2014}}, } @inproceedings{20126, author = {{Hamann, Heiko}}, booktitle = {{Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)}}, pages = {{31--32}}, title = {{{Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal}}}, doi = {{10.1145/2598394.2598507}}, year = {{2014}}, } @inproceedings{20127, author = {{Birattari, Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca, Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}}, booktitle = {{Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}}, pages = {{262--269}}, title = {{{Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation}}}, doi = {{10.1007/978-3-319-09952-1_25}}, volume = {{8667}}, year = {{2014}}, } @inbook{20128, author = {{Khaluf, Yara and Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Bartz-Beielstein, T.}}, booktitle = {{13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)}}, pages = {{181--190}}, publisher = {{Springer}}, title = {{{Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements}}}, doi = {{10.1007/978-3-319-10762-2_18}}, volume = {{8672}}, year = {{2014}}, }