@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}}, } @inproceedings{20129, author = {{Hamann, Heiko and Sayama, Hiroki and Rieffel, John and Risi, Sebastian and Doursat, Rene and Lipson, Hod}}, booktitle = {{14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)}}, pages = {{344--351}}, publisher = {{MIT Press}}, title = {{{Evolution of Collective Behaviors by Minimizing Surprise}}}, doi = {{10.7551/978-0-262-32621-6-ch055}}, year = {{2014}}, } @inproceedings{20130, author = {{Cervera, Enric and Khaluf, Yara and Birattari, Mauro and Hamann, Heiko and Pobil, Angel P. del and Chinellato, Eris and Martinez-Martin, Ester and Hallam, John and Morales, Antonio}}, booktitle = {{Simulation of Adaptive Behavior (SAB 2014)}}, pages = {{270--279}}, title = {{{A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs}}}, doi = {{10.1007/978-3-319-08864-8_26}}, volume = {{8575}}, year = {{2014}}, } @inproceedings{368, abstract = {{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.}}, author = {{Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim }}, booktitle = {{Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{128--137}}, title = {{{Scheduling Shared Continuous Resources on Many-Cores}}}, doi = {{10.1145/2612669.2612698}}, year = {{2014}}, } @inproceedings{370, abstract = {{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. }}, author = {{Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}}, booktitle = {{Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)}}, pages = {{352--360}}, title = {{{Routing Games with Progressive Filling}}}, doi = {{10.1109/TNET.2015.2468571}}, year = {{2014}}, } @misc{373, author = {{Pahl, David}}, publisher = {{Universität Paderborn}}, title = {{{Reputationssysteme für zusammengesetzte Dienstleistungen}}}, year = {{2014}}, } @inproceedings{379, abstract = {{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.}}, author = {{Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{25--34}}, title = {{{Randomized Online Algorithms for Set Cover Leasing Problems}}}, doi = {{10.1007/978-3-319-12691-3_3}}, year = {{2014}}, } @inproceedings{380, abstract = {{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}}}, author = {{Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}}, pages = {{423--428}}, title = {{{Quality of Service in Network Creation Games}}}, doi = {{10.1007/978-3-319-13129-0_34}}, 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}}, keywords = {{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{17660, author = {{Polevoy, Gleb 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}}, keywords = {{dynamics, emotion modeling, negotiation, network interaction, shared effort game}}, pages = {{1741--1742}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{Improving Human Interaction in Crowdsensing}}}, 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}}, keywords = {{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}}, }