@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{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},
}
@inproceedings{19988,
author = {Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam},
booktitle = {13th European Conference on Artificial Life (ECAL 2015)},
pages = {174},
publisher = {MIT Press},
title = {{Evolving Collective Behaviors With Diverse But Predictable Sensor States}},
doi = {10.7551/978-0-262-33027-5-ch036},
year = {2015},
}
@inproceedings{19990,
author = {Ding, Hongli and Hamann, Heiko},
booktitle = {First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)},
title = {{Dependability in Swarm Robotics: Error Detection and Correction}},
year = {2015},
}
@inproceedings{20005,
author = {Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele},
booktitle = {Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)},
title = {{Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}},
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 },
keyword = {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{453,
abstract = {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.},
author = {Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander},
booktitle = {Proceedings of the 10th International Conference on Web and Internet Economics (WINE)},
pages = {30--43},
title = {{Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}},
doi = {10.1007/978-3-319-13129-0_3},
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{17661,
author = {King, Thomas C. and Liu, Qingzhi and Polevoy, Gleb and de Weerdt, Mathijs and Dignum, Virginia and van Riemsdijk, M. Birna and Warnier, Martijn},
booktitle = {Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
isbn = {978-1-4503-2738-1},
keyword = {crowd-sensing, crowdsourcing, data aggregation, game theory, norms, reciprocation, self interested agents, simulation},
pages = {1651--1652},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
title = {{Request Driven Social Sensing}},
year = {2014},
}
@inproceedings{17659,
author = {Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.},
booktitle = {Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
isbn = {978-1-4503-2738-1},
keyword = {competition, equilibrium, market, models, shared effort games, simulation},
pages = {861--868},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
title = {{Nash Equilibria in Shared Effort Games}},
year = {2014},
}
@inproceedings{395,
abstract = {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.},
author = {Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
booktitle = {Proceedings of the 10th International Conference on Web and Internet Economics (WINE)},
pages = {435--440},
title = {{Multilevel Network Games}},
doi = {10.1007/978-3-319-13129-0_36},
year = {2014},
}
@inproceedings{435,
abstract = {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.},
author = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
booktitle = {Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)},
pages = {63----74},
title = {{Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}},
doi = {10.4230/LIPIcs.STACS.2014.63},
year = {2014},
}
@inproceedings{459,
abstract = {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.},
author = {Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian},
booktitle = {Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
pages = {1--13},
title = {{Algorithmic Aspects of Resource Management in the Cloud}},
doi = {10.1007/978-3-319-09620-9_1},
year = {2014},
}
@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{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},
}
@article{17662,
author = {Polevoy, Gleb and Smorodinsky, Rann and Tennenholtz, Moshe},
issn = {2167-8375},
journal = {ACM Trans. Econ. Comput.},
keyword = {Competition, efficiency, equilibrium, market, social welfare},
number = {1},
pages = {1:1--1:16},
publisher = {ACM},
title = {{Signaling Competition and Social Welfare}},
doi = {10.1145/2560766},
volume = {2},
year = {2014},
}
@phdthesis{431,
abstract = {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.},
author = {Kling, Peter},
publisher = {Universität Paderborn},
title = {{Energy-efficient Scheduling Algorithms}},
year = {2014},
}
@inproceedings{412,
abstract = {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.},
author = {Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman},
booktitle = {Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)},
pages = {1--10},
title = {{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}},
doi = {10.1109/P2P.2014.6934300},
year = {2014},
}
@misc{373,
author = {Pahl, David},
publisher = {Universität Paderborn},
title = {{Reputationssysteme für zusammengesetzte Dienstleistungen}},
year = {2014},
}