TY - JOUR AU - Hamann, Heiko AU - Khaluf, Yara AU - Botev, Jean AU - Divband Soorati, Mohammad AU - Ferrante, Eliseo AU - Kosak, Oliver AU - Montanier, Jean-Marc AU - Mostaghim, Sanaz AU - Redpath, Richard AU - Timmis, Jon AU - Veenstra, Frank AU - Wahby, Mostafa AU - Zamuda, Aleš ID - 19969 JF - Frontiers in Robotics and AI SN - 2296-9144 TI - Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems ER - TY - CONF AU - Hamann, Heiko AU - Divband Soorati, Mohammad ID - 19979 T2 - IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016) TI - Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures ER - TY - JOUR AU - Dorigo, Marco AU - Hamann, Heiko AU - Valentini, Gabriele AU - Ferrante, Eliseo ID - 19983 IS - 3 JF - Journal of Autonomous Agents and Multi-Agent Systems TI - Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems VL - 30 ER - TY - THES AU - Drees, Maximilian ID - 200 TI - Existence and Properties of Pure Nash Equilibria in Budget Games ER - TY - CONF AU - Hamann, Heiko AU - Valentini, Gabriele AU - Dorigo, Marco ID - 20000 SN - 0302-9743 T2 - 10th Int. Conf. on Swarm Intelligence, ANTS 2016 TI - Population Coding: A New Design Paradigm for Embodied Distributed Systems ER - TY - CONF AU - von Mammen, Sebastian AU - Hamann, Heiko AU - Heider, Michael ID - 20001 SN - 9781450344913 T2 - ACM Symposium on Virtual Reality Software and Technology (VRST) TI - Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems ER - TY - CONF AU - Rybář, Milan AU - Hamann, Heiko ID - 20002 SN - 9781450342063 T2 - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016) TI - Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes ER - TY - CONF AU - Khaluf, Yara AU - Hamann, Heiko ID - 20003 T2 - ANTS 2016 TI - On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations VL - 9882 ER - TY - CONF AU - Valentini, Gabriele AU - Brambilla, Davide AU - Hamann, Heiko AU - Dorigo, Marco ID - 20004 SN - 0302-9743 T2 - 10th Int. Conf. on Swarm Intelligence, ANTS 2016 TI - Collective Perception of Environmental Features in a Robot Swarm ER - TY - GEN AU - Leder, Lennart ID - 210 TI - Congestion Games with Mixed Objectives ER - TY - CONF AB - We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems. AU - Drees, Maximilian AU - Gmyr, Robert AU - Scheideler, Christian ID - 215 T2 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) TI - Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration ER - TY - CONF AU - Polevoy, Gleb AU - de Weerdt, M.M. AU - Jonker, C.M. ID - 17655 KW - agents KW - action KW - repeated reciprocation KW - fixed KW - floating KW - network KW - Nash equilibrium KW - social welfare KW - price of anarchy KW - price of stability KW - convex combination T2 - Proceedings of the 2016 European Conference on Artificial Intelligence TI - The Game of Reciprocation Habits VL - Volume 285: ECAI 2016 ER - TY - CONF AU - Polevoy, Gleb AU - de Weerdt, Mathijs AU - Jonker, Catholijn ID - 17656 KW - agent's influence KW - behavior KW - convergence KW - perron-frobenius KW - reciprocal interaction KW - repeated reciprocation SN - 978-1-4503-4239-1 T2 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems TI - The Convergence of Reciprocation ER - TY - CONF AB - Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus. AU - Abu-Khzam, Faisal N. AU - Li, Shouwei AU - Markarian, Christine AU - Meyer auf der Heide, Friedhelm AU - Podlipyan, Pavel ID - 177 T2 - Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) TI - On the Parameterized Parallel Complexity and the Vertex Cover Problem ER - TY - GEN ED - Meyer auf der Heide, Friedhelm ID - 187 IS - 1 T2 - Transactions on Parallel Computing (TOPC) TI - Introduction to the Special Issue on SPAA 2014 ER - TY - CONF AB - We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\beta$. While for $\beta series = {LNCS} AU - Mäcker, Alexander AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm AU - Riechers, Sören ID - 207 T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) TI - Cost-efficient Scheduling on Machines from the Cloud ER - TY - CONF AB - We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria. AU - Feldotto, Matthias AU - Leder, Lennart AU - Skopalik, Alexander ID - 209 T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) TI - Congestion Games with Mixed Objectives ER - TY - GEN AU - Bülling, Jonas ID - 5406 TI - Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden ER - TY - GEN AU - Koepe, Jörn ID - 5407 TI - Price-Based Allocation Games ER - TY - GEN AU - Kutzias, Damian ID - 688 TI - Friendship Processes in Network Creation Games ER -