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 - GEN
AU - Handirk, Tobias
ID - 1082
TI - Über die Rolle von Informationen in Verkehrsnetzwerken
ER -
TY - JOUR
AB - We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).
AU - Abshoff, Sebastian
AU - Kling, Peter
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Pietrzyk, Peter
ID - 139
IS - 4
JF - Journal of Combinatorial Optimization
TI - Towards the price of leasing online
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 - 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 - Schaefer, Johannes Sebastian
ID - 689
TI - Routing Algorithms on Delayed Networks for Disaster Management Support
ER -
TY - CONF
AB - Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.
AU - Fischer, Matthias
AU - Jähn, Claudius
AU - Meyer auf der Heide, Friedhelm
AU - Petring, Ralf
ED - Kliemann, Lasse
ED - Sanders, Peter
ID - 16351
T2 - Algorithm Engineering
TI - Algorithm Engineering Aspects of Real-Time Rendering Algorithms
VL - 9220
ER -
TY - CONF
AU - Heinrich, Mary Katherine
AU - Wahby, Mostafa
AU - Divband Soorati, Mohammad
AU - Hofstadler, Daniel Nicolas
AU - Zahadat, Payam
AU - Ayres, Phil
AU - Stoy, Kasper
AU - Hamann, Heiko
ID - 19968
SN - 9781509036516
T2 - Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)
TI - Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures
ER -
TY - GEN
AU - Koepe, Jörn
ID - 5407
TI - Price-Based Allocation Games
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 - JOUR
AB - Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.
AU - Harks, Tobias
AU - Höfer, Martin
AU - Schewior, Kevin
AU - Skopalik, Alexander
ID - 159
IS - 4
JF - IEEE/ACM Transactions on Networking
TI - Routing Games With Progressive Filling
ER -
TY - CONF
AU - Macker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 16364
SN - 9781509021406
T2 - 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
TI - On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams
ER -
TY - THES
AU - Drees, Maximilian
ID - 200
TI - Existence and Properties of Pure Nash Equilibria in Budget Games
ER -
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 - 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 - 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 - THES
AU - Cord Landwehr, Andreas
ID - 154
SN - 978-3-942647-72-4
TI - Selfish Network Creation - On Variants of Network Creation Games
VL - 353
ER -
TY - JOUR
AU - Degener, Bastian
AU - Kempkes, Barbara
AU - Kling, Peter
AU - Meyer auf der Heide, Friedhelm
ID - 16391
JF - ACM Transactions on Parallel Computing
SN - 2329-4949
TI - Linear and Competitive Strategies for Continuous Robot Formation Problems
ER -
TY - GEN
AU - Pfannschmidt, Karlson
ID - 251
TI - Solving the aggregated bandits problem
ER -
TY - CONF
AB - 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.
AU - Cord-Landwehr, Andreas
AU - Lenzner, Pascal
ID - 275
T2 - Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)
TI - Network Creation Games: Think Global - Act Local
ER -