@misc{5404,
author = {Kolpaczki, Patrick Irenäus},
publisher = {Universität Paderborn},
title = {{Online Algorithmen für das k-Page Migration Problem}},
year = {2018},
}
@article{17666,
abstract = {Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.},
author = {Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.},
issn = {0167-739X},
journal = {Future Generation Computer Systems},
keyword = {Software defined networks, Network function virtualization, Cyber attacks, Cyber security, Defense efficiency, Overlay networks},
title = {{Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}},
doi = {https://doi.org/10.1016/j.future.2018.08.011},
year = {2018},
}
@misc{1186,
author = {Kemper, Arne},
publisher = {Universität Paderborn},
title = {{Pure Nash Equilibria in Robust Congestion Games via Potential Functions}},
year = {2018},
}
@article{1369,
abstract = {In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.},
author = {Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander},
issn = {1382-6905},
journal = {Journal of Combinatorial Optimization},
publisher = {Springer Nature},
title = {{Pure Nash equilibria in restricted budget games}},
doi = {10.1007/s10878-018-0269-7},
year = {2018},
}
@inbook{16392,
author = {Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm},
booktitle = {Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications},
isbn = {9783319125671},
issn = {0302-9743},
title = {{A Dynamic Distributed Data Structure for Top-k and k-Select Queries}},
doi = {10.1007/978-3-319-98355-4_18},
year = {2018},
}
@inproceedings{2831,
abstract = {We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.},
author = {Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja},
booktitle = {Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)},
isbn = {978-1-4503-5916-0},
location = {Irvine, California, USA},
pages = {5:1--5:6},
title = {{Disaggregating User Evaluations Using the Shapley Value}},
doi = {10.1145/3230654.3230659},
year = {2018},
}
@article{2848,
author = {Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm},
journal = {Algorithmica},
number = {5},
pages = {1556–1574},
publisher = {Springer},
title = {{Towards Flexible Demands in Online Leasing Problems. }},
doi = {10.1007/s00453-018-0420-y},
volume = {80},
year = {2018},
}
@inproceedings{4375,
abstract = {We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\bigtimes_{i=1}^{d}[a_i,\,b_i]$ in a $d$-dimensional point space.\\
The network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).
We show how to execute such range queries using $\mathcal{O}\left(2^{d'}d\,\log m + d\,|R|\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.
Furthermore, if the peers form a distributed network, the query can be answered in $\mathcal{O}\left(d\,\log m + d\,\sum_{i=1}^{d}(b_i-a_i+1)\right)$ communication rounds.
Our algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.},
author = {Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
booktitle = {Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)},
keyword = {Distributed Storage, Multi-Dimensional Range Queries, Peer-to-Peer, Hilbert Curve},
location = {Helsinki},
title = {{A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}},
doi = {10.1007/978-3-030-19759-9_4},
year = {2018},
}
@inproceedings{2850,
author = {Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
booktitle = {Ninth International Conference on Fun with Algorithms (FUN)},
title = {{Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}},
doi = {10.4230/LIPIcs.FUN.2018.22},
year = {2018},
}
@unpublished{19978,
abstract = {We introduce the \emph{Online Connected Dominating Set Leasing} problem
(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set
$\mathcal{L}$ of lease types each characterized by a duration and cost, and a
sequence of subsets of $V$ arriving over time. A node can be leased using lease
type $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives
in each step $t$ a subset of nodes that need to be dominated by a connected
subgraph consisting of nodes active at time $t$. The goal is to minimize the
total leasing costs. OCDSL contains the \emph{Parking Permit
Problem}~\cite{PPP} as a special subcase and generalizes the classical offline
\emph{Connected Dominating Set} problem~\cite{Guha1998}. It has an $\Omega(\log
^2 n + \log |\mathcal{L}|)$ randomized lower bound resulting from lower bounds
for the \emph{Parking Permit Problem} and the \emph{Online Set Cover}
problem~\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\mathcal{L}|$ is the
number of available lease types and $n$ is the number of nodes in the input
graph. We give a randomized $\mathcal{O}(\log ^2 n + \log |\mathcal{L}| \log
n)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for
a variant of OCDSL in which the dominating subgraph need not be connected, the
\emph{Online Dominating Set Leasing} problem. The latter is based on a simple
primal-dual approach and has an $\mathcal{O}(|\mathcal{L}| \cdot
\Delta)$-competitive ratio, where $\Delta$ is the maximum degree of the input
graph.},
author = {Markarian, Christine},
booktitle = {arXiv:1805.02994},
title = {{Online Connected Dominating Set Leasing}},
year = {2018},
}
@inproceedings{4565,
author = {Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik},
booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)},
isbn = {9781450357999},
location = {Wien},
publisher = {ACM Press},
title = {{Brief Announcement: Competitive Routing in Hybrid Communication Networks}},
doi = {10.1145/3210377.3210663},
year = {2018},
}
@misc{1187,
author = {Nachtigall, Marcel},
publisher = {Universität Paderborn},
title = {{Scenario-driven Strategy Analysis in a n-player Composition Game Model}},
year = {2018},
}
@article{2849,
author = {Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael},
journal = {Theory of Computing Systems},
publisher = {Springer},
title = {{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}},
doi = {10.1007/s00224-017-9836-z},
year = {2018},
}
@article{3551,
author = {König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
journal = {Journal of Combinatorial Optimization},
number = {4},
pages = {1356--1379},
title = {{Scheduling with interjob communication on parallel processors}},
doi = {10.1007/s10878-018-0325-3},
volume = {36},
year = {2018},
}
@article{669,
abstract = {We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria.},
author = {Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
issn = {1382-6905},
journal = {Journal of Combinatorial Optimization},
number = {4},
pages = {1145--1167},
publisher = {Springer Nature},
title = {{Congestion games with mixed objectives}},
doi = {10.1007/s10878-017-0189-y},
volume = {36},
year = {2018},
}
@article{63,
author = {Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Süß, Tim},
journal = {Journal of Scheduling},
number = {1},
pages = {77--92},
publisher = {Springer},
title = {{Scheduling Shared Continuous Resources on Many-Cores}},
doi = {10.1007/s10951-017-0518-0},
volume = {21},
year = {2018},
}
@inproceedings{17651,
abstract = {Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\$}{\$}2 {\backslash}sqrt{\{} 2{\backslash}left| E {\backslash}right| {\}}{\$}{\$}and {\$}{\$}2 {\backslash}sqrt{\{}2 ({\backslash}left| E {\backslash}right| + {\backslash}left| {\backslash}text {\{}undesirable flows{\}} {\backslash}right| ){\}}{\$}{\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.},
author = {Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees},
booktitle = {Combinatorial Optimization and Applications},
editor = {Kim, Donghyun and Uma, R. N. and Zelikovsky, Alexander},
isbn = {978-3-030-04651-4},
keyword = {flow, Red-Blue Set Cover, Positive-Negative Partial Set Cover, approximation, tree, MAX SNP-hard, root, leaf, dynamic programming, FPT},
pages = {217--232},
publisher = {Springer International Publishing},
title = {{Removing Undesirable Flows by Edge Deletion}},
year = {2018},
}
@misc{1188,
author = {Kempf, Jérôme},
publisher = {Universität Paderborn},
title = {{Learning deterministic bandit behaviour form compositions}},
year = {2018},
}
@inproceedings{2484,
abstract = {We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.},
author = {Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald},
isbn = {978-3-95977-076-7},
issn = {1868-8969},
location = {Prag},
pages = {51:1--51:24},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
title = {{Fully-Dynamic Bin Packing with Little Repacking}},
doi = {10.4230/LIPIcs.ICALP.2018.51},
volume = {107},
year = {2018},
}
@inproceedings{4411,
abstract = {While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.
Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.
In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.
The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.
Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses.
We show how to maintain the structure in a self-stabilizing way.
Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.},
author = {Knollmann, Till and Scheideler, Christian},
booktitle = {Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
editor = {Izumi, Taisuke and Kuznetsov, Petr},
keyword = {Self-Stabilizing, Prefix Search, Distributed Data Structure},
location = {Tokyo},
publisher = {Springer, Cham},
title = {{A Self-Stabilizing Hashed Patricia Trie}},
doi = {10.1007/978-3-030-03232-6_1},
volume = {11201},
year = {2018},
}
@inproceedings{2485,
author = {Feldkord, Björn and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
location = {Wien},
pages = {373 -- 381 },
publisher = {ACM},
title = {{Online Facility Location with Mobile Facilities}},
doi = {10.1145/3210377.3210389},
year = {2018},
}
@misc{3851,
author = {Koop, Samuel},
publisher = {Universität Paderborn},
title = {{Congestion Games mit gewichteten Strategien}},
year = {2018},
}
@misc{5403,
author = {Geromel, Marcel},
publisher = {Universität Paderborn},
title = {{Mobile Facility Leasing}},
year = {2018},
}
@inproceedings{4563,
abstract = {Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.
In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
},
author = {Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik},
booktitle = {Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) },
keyword = {greedy routing, ad hoc networks, convex hulls, c-competitiveness},
location = {Helsinki},
publisher = {Springer},
title = {{Competitive Routing in Hybrid Communication Networks}},
year = {2018},
}
@phdthesis{1209,
abstract = {My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.},
author = {Jung, Daniel},
isbn = {978-3-942647-99-1},
publisher = {Universität Paderborn},
title = {{Local Strategies for Swarm Formations on a Grid}},
doi = {10.17619/UNIPB/1-271},
year = {2018},
}
@inproceedings{112,
abstract = {We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.},
author = {Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
booktitle = {Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)},
pages = {222----233},
title = {{Congestion Games with Complementarities}},
doi = {10.1007/978-3-319-57586-5_19},
year = {2017},
}
@inproceedings{16339,
abstract = {In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren.},
author = {Brandt, Sascha and Fischer, Matthias},
booktitle = {Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017},
location = {Paderborn},
pages = {415--427},
publisher = {Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
title = {{Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}},
volume = {369},
year = {2017},
}
@inproceedings{59,
abstract = {We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed).},
author = {Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander},
booktitle = {Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {123----132},
title = {{Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}},
doi = {10.1145/3087556.3087578},
year = {2017},
}
@inproceedings{66,
abstract = {In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.},
author = {Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander},
booktitle = {Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)},
pages = {175----187},
title = {{Pure Nash Equilibria in Restricted Budget Games}},
doi = {10.1007/978-3-319-62389-4_15},
year = {2017},
}
@inbook{16461,
author = {Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören and Schaefer, Johannes and Sundermeier, Jannik},
booktitle = {Structural Information and Communication Complexity},
isbn = {9783319720494},
issn = {0302-9743},
title = {{Monitoring of Domain-Related Problems in Distributed Data Streams}},
doi = {10.1007/978-3-319-72050-0_13},
year = {2017},
}
@article{706,
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
journal = {Journal of Combinatorial Optimization},
number = {4},
pages = {1168--1194},
publisher = {Springer},
title = {{Cost-efficient Scheduling on Machines from the Cloud}},
doi = {10.1007/s10878-017-0198-x},
volume = {36},
year = {2017},
}
@inproceedings{97,
abstract = {Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets.},
author = {van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor},
booktitle = {2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)},
isbn = {978-1-5386-3489-9},
keyword = {Software, Unified modeling language, Requirements engineering, Ontologies, Search problems, Natural languages},
location = {Lisbon, Portugal},
pages = {379--385},
publisher = {IEEE},
title = {{From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}},
doi = {10.1109/REW.2017.26},
year = {2017},
}
@inproceedings{17654,
author = {Polevoy, Gleb and de Weerdt, M.M.},
booktitle = {Proceedings of the 29th Benelux Conference on Artificial Intelligence},
keyword = {agents, projects, contribute, shared effort game, competition, quota, threshold, Nash equilibrium, social welfare, efficiency, price of anarchy, price of stability},
publisher = {Springer},
title = {{Competition between Cooperative Projects}},
year = {2017},
}
@misc{1080,
author = {Bürmann, Jan},
publisher = {Universität Paderborn},
title = {{Complexity of Signalling in Routing Games under Uncertainty}},
year = {2017},
}
@misc{1073,
author = {Nachtigall, Simon},
publisher = {Universität Paderborn},
title = {{Sortieren dynamischer Daten}},
year = {2017},
}
@inproceedings{113,
abstract = {We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].},
author = {Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander},
booktitle = {Proceedings of the 13th International Conference on Web and Internet Economics (WINE)},
title = {{Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}},
doi = {10.1007/978-3-319-71924-5_14},
year = {2017},
}
@inproceedings{55,
abstract = {We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence.},
author = {Feldkord, Björn and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {313--319},
title = {{The Mobile Server Problem}},
doi = {10.1145/3087556.3087575},
year = {2017},
}
@inproceedings{79,
abstract = {Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.},
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)},
pages = {207--222},
publisher = {Springer},
title = {{Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}},
doi = {10.1007/978-3-319-89441-6},
volume = {10787},
year = {2017},
}
@inproceedings{16347,
author = {Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}},
editor = {Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A. and Zhang, Yanyong},
pages = {168--181},
publisher = {Springer},
title = {{Gathering Anonymous, Oblivious Robots on a Grid}},
doi = {10.1007/978-3-319-72751-6_13},
volume = {10718},
year = {2017},
}
@misc{1081,
author = {Vijayalakshmi, Vipin Ravindran},
publisher = {Universität Paderborn},
title = {{Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}},
year = {2017},
}
@misc{1074,
author = {Pukrop, Simon},
publisher = {Universität Paderborn},
title = {{Robuste Optimierung in Congestion Games}},
year = {2017},
}
@inproceedings{16348,
author = {Biermeier, Felix and Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)},
pages = {285 -- 300},
publisher = {Springer},
title = {{A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries}},
doi = {10.1007/978-3-319-89441-6_21},
year = {2017},
}
@inproceedings{2851,
author = {Markarian, Christine},
booktitle = {International Conference on Operations Research (OR)},
location = {Berlin},
title = {{Leasing with Uncertainty}},
doi = {10.1007/978-3-319-89920-6_57},
year = {2017},
}
@misc{695,
author = {Nowack, Joshua},
publisher = {Universität Paderborn},
title = {{On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}},
year = {2017},
}
@inproceedings{70,
author = {Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {17 -- 31},
title = {{Price Fluctuations in Online Leasing}},
doi = {10.1007/978-3-319-71147-8_2},
year = {2017},
}
@inproceedings{82,
abstract = {Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.},
author = {Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)},
pages = {139--150},
title = {{Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}},
doi = {10.1007/978-3-319-59605-1_13},
year = {2017},
}
@book{16444,
author = {Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar},
pages = {369},
title = {{Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}},
year = {2017},
}
@phdthesis{703,
author = {Podlipyan, Pavel},
publisher = {Universität Paderborn},
title = {{Local Algorithms for the Continuous Gathering Problem}},
doi = {10.17619/UNIPB/1-230},
year = {2017},
}
@article{110,
abstract = {We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof.},
author = {Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören},
journal = {Theoretical Computer Science},
pages = {1--13},
publisher = {Elsevier},
title = {{Continuous Speed Scaling with Variability: A Simple and Direct Approach}},
doi = {10.1016/j.tcs.2017.03.021},
year = {2017},
}
@inproceedings{1094,
abstract = {Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a "lean" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification.},
author = {Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander},
booktitle = {Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)},
pages = {462--467},
title = {{Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}},
doi = {10.1007/978-3-319-59144-5_32},
year = {2017},
}
@inproceedings{16349,
author = {Podlipyan, Pavel and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)},
pages = {182--197},
title = {{A Continuous Strategy for Collisionless Gathering}},
doi = {10.1007/978-3-319-72751-6_14 },
year = {2017},
}
@phdthesis{704,
author = {Riechers, Sören},
publisher = {Universität Paderborn},
title = {{Scheduling with Scarce Resources}},
doi = {10.17619/UNIPB/1-231},
year = {2017},
}
@inproceedings{17652,
author = {Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees},
booktitle = {Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I},
isbn = {978-3-319-71150-8},
keyword = {flow, filter, MMSA, set cover, approximation, local ratio algorithm},
pages = {3--17},
publisher = {Springer International Publishing},
title = {{Filtering Undesirable Flows in Networks}},
doi = {10.1007/978-3-319-71150-8_1},
year = {2017},
}
@unpublished{17811,
abstract = {We consider a swarm of $n$ autonomous mobile robots, distributed on a
2-dimensional grid. A basic task for such a swarm is the gathering process: All
robots have to gather at one (not predefined) place. A common local model for
extremely simple robots is the following: The robots do not have a common
compass, only have a constant viewing radius, are autonomous and
indistinguishable, can move at most a constant distance in each step, cannot
communicate, are oblivious and do not have flags or states. The only gathering
algorithm under this robot model, with known runtime bounds, needs
$\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time
model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On
the other side, in the case of the 2-dimensional grid, the only known gathering
algorithms for the same time and a similar local model additionally require a
constant memory, states and "flags" to communicate these states to neighbors in
viewing range. They gather in time $\mathcal{O}(n)$.
In this paper we contribute the (to the best of our knowledge) first
gathering algorithm on the grid that works under the same simple local model as
the above mentioned Euclidean plane strategy, i.e., without memory (oblivious),
"flags" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time
bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound
matches the time bound of the best known algorithm for the Euclidean plane
mentioned above. We say gathering is done if all robots are located within a
$2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be
solved.},
author = {Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {arXiv:1702.03400},
title = {{Gathering Anonymous, Oblivious Robots on a Grid}},
year = {2017},
}
@inproceedings{1095,
abstract = {Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. },
author = {John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike},
booktitle = {Proceedings of the 25th European Conference on Information Systems (ECIS)},
pages = {2970--2979},
title = {{Towards a Lean Approach for Gamifying Education}},
year = {2017},
}
@inproceedings{16338,
abstract = {To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system’s virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines.},
author = {Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius and Berssenbrügge, Jan},
booktitle = {Volume 1: 37th Computers and Information in Engineering Conference},
isbn = {9780791858110},
location = {Cleveland, USA},
pages = {91:1--91:10},
title = {{Automatic Derivation of Geometric Properties of Components From 3D Polygon Models}},
doi = {10.1115/detc2017-67528},
volume = {1},
year = {2017},
}
@phdthesis{19604,
author = {Li, Shouwei},
title = {{Parallel fixed parameter tractable problems}},
doi = {10.17619/UNIPB/1-252},
year = {2017},
}
@inproceedings{17653,
author = {Polevoy, Gleb and de Weerdt, M.M.},
booktitle = {Proceedings of the 29th Benelux Conference on Artificial Intelligence},
keyword = {interaction, reciprocation, contribute, shared effort, curbing, convergence, threshold, Nash equilibrium, social welfare, efficiency, price of anarchy, price of stability},
publisher = {Springer},
title = {{Reciprocation Effort Games}},
year = {2017},
}
@inproceedings{143,
abstract = {We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].},
author = {Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)},
pages = {92--102},
title = {{The Monotone Circuit Value Problem with Bounded Genus Is in NC}},
doi = {10.1007/978-3-319-42634-1_8},
year = {2016},
}
@inproceedings{16358,
author = {Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)},
publisher = {Springer},
title = {{The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}},
doi = {10.1007/978-3-319-53058-1_5 },
year = {2016},
}
@unpublished{16396,
abstract = {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 < s$
no finite competitiveness is possible, our main result is an
$O(\frac{c}{\varepsilon} + \frac{1}{\varepsilon^3})$-competitive online
algorithm for $\beta = (1+\varepsilon)s$ with $\frac{1}{s} \leq \varepsilon
\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of
the machine-types, respectively. It is complemented by a lower bound of
$\Omega(\frac{c}{\varepsilon})$.},
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {arXiv:1609.01184},
title = {{Cost-efficient Scheduling on Machines from the Cloud}},
year = {2016},
}
@inproceedings{20001,
author = {von Mammen, Sebastian and Hamann, Heiko and Heider, Michael},
booktitle = {ACM Symposium on Virtual Reality Software and Technology (VRST)},
isbn = {9781450344913},
title = {{Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems}},
doi = {10.1145/2993369.2993400},
year = {2016},
}
@inproceedings{16360,
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*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the 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 FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, 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 = {Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {689--699},
publisher = {IEEE},
title = {{Gathering a Closed Chain of Robots on a Grid}},
doi = {10.1109/IPDPS.2016.51},
year = {2016},
}
@inproceedings{149,
abstract = {In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).},
author = {Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {593----607},
title = {{Strategic Online Facility Location}},
doi = {10.1007/978-3-319-48749-6_43},
year = {2016},
}
@proceedings{163,
editor = {Dressler, Falko and Meyer auf der Heide, Friedhelm},
location = {Paderborn, Germany},
publisher = {ACM},
title = {{Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}},
doi = {10.1145/2942358},
year = {2016},
}
@inproceedings{207,
abstract = {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}},
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {578----592},
title = {{Cost-efficient Scheduling on Machines from the Cloud}},
doi = {10.1007/978-3-319-48749-6_42},
year = {2016},
}
@misc{187,
booktitle = {Transactions on Parallel Computing (TOPC)},
editor = {Meyer auf der Heide, Friedhelm},
number = {1},
pages = {1},
title = {{Introduction to the Special Issue on SPAA 2014}},
doi = {10.1145/2936716},
year = {2016},
}
@inproceedings{19961,
abstract = {The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach.},
author = {Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich, Mary Katherine and Zahadat, Payam and Hamann, Heiko},
booktitle = {Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems},
isbn = {9781509035342},
title = {{An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap}},
doi = {10.1109/saso.2016.8},
year = {2016},
}
@inproceedings{20002,
author = {Rybář, Milan and Hamann, Heiko},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)},
isbn = {9781450342063},
title = {{Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes}},
doi = {10.1145/2908812.2908815},
year = {2016},
}
@inproceedings{17655,
author = {Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.},
booktitle = {Proceedings of the 2016 European Conference on Artificial Intelligence},
keyword = {agents, action, repeated reciprocation, fixed, floating, network, Nash equilibrium, social welfare, price of anarchy, price of stability, convex combination},
pages = {417--425},
title = {{The Game of Reciprocation Habits}},
doi = {10.3233/978-1-61499-672-9-417},
volume = {Volume 285: ECAI 2016},
year = {2016},
}
@inproceedings{16359,
abstract = {In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).},
author = {Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {301--312},
publisher = {ACM},
title = {{Asymptotically Optimal Gathering on a Grid}},
doi = {10.1145/2935764.2935789},
year = {2016},
}
@unpublished{16450,
abstract = {In this paper, we solve the local gathering problem of a swarm of $n$
indistinguishable, point-shaped robots on a two dimensional grid in
asymptotically optimal time $\mathcal{O}(n)$ in the fully synchronous
$\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)
swarm of robots, the gathering problem on the grid is to locate all robots
within a $2\times 2$-sized area that is not known beforehand. Two robots are
connected if they are vertical or horizontal neighbors on the grid. The
locality constraint means that no global control, no compass, no global
communication and only local vision is available; hence, a robot can only see
its grid neighbors up to a constant $L_1$-distance, which also limits its
movements. A robot can move to one of its eight neighboring grid cells and if
two or more robots move to the same location they are \emph{merged} to be only
one robot. The locality constraint is the significant challenging issue here,
since robot movements must not harm the (only globally checkable) swarm
connectivity. For solving the gathering problem, we provide a synchronous
algorithm -- executed by every robot -- which ensures that robots merge without
breaking the swarm connectivity. In our model, robots can obtain a special
state, which marks such a robot to be performing specific connectivity
preserving movements in order to allow later merge operations of the swarm.
Compared to the grid, for gathering in the Euclidean plane for the same robot
and time model the best known upper bound is $\mathcal{O}(n^2)$.},
author = {Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {arXiv:1602.03303},
title = {{Asymptotically Optimal Gathering on a Grid}},
year = {2016},
}
@article{145,
abstract = {Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. },
author = {Feldotto, Matthias and Graffi, Kalman},
journal = {Concurrency and Computation: Practice and Experience},
number = {5},
pages = {1655--1677},
publisher = {Wiley Online Library},
title = {{Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}},
doi = {10.1002/cpe.3716},
volume = {28},
year = {2016},
}
@inproceedings{157,
abstract = {Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.},
author = {König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {563----577},
title = {{Scheduling with Interjob Communication on Parallel Processors}},
doi = {10.1007/978-3-319-48749-6_41},
year = {2016},
}
@misc{210,
author = {Leder, Lennart},
publisher = {Universität Paderborn},
title = {{Congestion Games with Mixed Objectives}},
year = {2016},
}
@misc{5406,
author = {Bülling, Jonas},
title = {{Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}},
year = {2016},
}
@misc{688,
author = {Kutzias, Damian},
publisher = {Universität Paderborn},
title = {{Friendship Processes in Network Creation Games}},
year = {2016},
}
@inproceedings{19979,
author = {Hamann, Heiko and Divband Soorati, Mohammad},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)},
title = {{Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures}},
doi = {10.1109/IROS.2016.7759845},
year = {2016},
}
@inproceedings{20003,
author = {Khaluf, Yara and Hamann, Heiko},
booktitle = {ANTS 2016},
pages = {298},
title = {{On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations}},
volume = {9882},
year = {2016},
}
@inproceedings{169,
abstract = {We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.},
author = {Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor},
booktitle = {Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)},
pages = {278----293},
title = {{Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}},
doi = {10.1007/978-3-319-30668-1_18},
year = {2016},
}
@inproceedings{17656,
author = {Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems},
isbn = {978-1-4503-4239-1},
keyword = {agent's influence, behavior, convergence, perron-frobenius, reciprocal interaction, repeated reciprocation},
pages = {1431--1432},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
title = {{The Convergence of Reciprocation}},
year = {2016},
}
@inproceedings{215,
abstract = {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.},
author = {Drees, Maximilian and Gmyr, Robert and Scheideler, Christian},
booktitle = {Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {417----427},
title = {{Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}},
doi = {10.1145/2935764.2935783},
year = {2016},
}
@misc{1082,
author = {Handirk, Tobias},
publisher = {Universität Paderborn},
title = {{Über die Rolle von Informationen in Verkehrsnetzwerken}},
year = {2016},
}
@article{139,
abstract = {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).},
author = {Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter },
journal = {Journal of Combinatorial Optimization},
number = {4},
pages = { 1197----1216},
publisher = {Springer},
title = {{Towards the price of leasing online}},
doi = {10.1007/s10878-015-9915-5},
year = {2016},
}
@inproceedings{177,
abstract = {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.},
author = {Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {477--488},
title = {{On the Parameterized Parallel Complexity and the Vertex Cover Problem}},
doi = {10.1007/978-3-319-48749-6_35},
year = {2016},
}
@inproceedings{209,
abstract = {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.},
author = {Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {655----669},
title = {{Congestion Games with Mixed Objectives}},
doi = {10.1007/978-3-319-48749-6_47},
year = {2016},
}
@misc{689,
author = {Schaefer, Johannes Sebastian},
publisher = {Universität Paderborn},
title = {{Routing Algorithms on Delayed Networks for Disaster Management Support}},
year = {2016},
}
@inproceedings{16351,
abstract = {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.
},
author = {Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf},
booktitle = {Algorithm Engineering},
editor = {Kliemann, Lasse and Sanders, Peter},
pages = {226--244},
publisher = {Springer},
title = {{Algorithm Engineering Aspects of Real-Time Rendering Algorithms}},
doi = {10.1007/978-3-319-49487-6_7 },
volume = {9220},
year = {2016},
}
@inproceedings{19968,
author = {Heinrich, Mary Katherine and Wahby, Mostafa and Divband Soorati, Mohammad and Hofstadler, Daniel Nicolas and Zahadat, Payam and Ayres, Phil and Stoy, Kasper and Hamann, Heiko},
booktitle = {Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)},
isbn = {9781509036516},
title = {{Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures}},
doi = {10.1109/fas-w.2016.43},
year = {2016},
}
@misc{5407,
author = {Koepe, Jörn},
publisher = {Universität Paderborn},
title = {{Price-Based Allocation Games}},
year = {2016},
}
@inproceedings{20004,
author = {Valentini, Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco},
booktitle = {10th Int. Conf. on Swarm Intelligence, ANTS 2016},
isbn = {9783319444260},
issn = {0302-9743},
title = {{Collective Perception of Environmental Features in a Robot Swarm}},
doi = {10.1007/978-3-319-44427-7_6},
year = {2016},
}
@article{159,
abstract = {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.},
author = {Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander},
journal = {IEEE/ACM Transactions on Networking},
number = {4},
pages = {2553 -- 2562},
publisher = {IEEE},
title = {{Routing Games With Progressive Filling}},
doi = {10.1109/TNET.2015.2468571},
year = {2016},
}
@inproceedings{16364,
author = {Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm},
booktitle = {2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
isbn = {9781509021406},
title = {{On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}},
doi = {10.1109/ipdps.2016.91},
year = {2016},
}
@phdthesis{154,
author = {Cord Landwehr, Andreas},
isbn = {978-3-942647-72-4},
publisher = {Universität Paderborn},
title = {{Selfish Network Creation - On Variants of Network Creation Games}},
year = {2016},
}
@phdthesis{200,
author = {Drees, Maximilian},
publisher = {Universität Paderborn},
title = {{Existence and Properties of Pure Nash Equilibria in Budget Games}},
year = {2016},
}
@article{19969,
author = {Hamann, Heiko and Khaluf, Yara and Botev, Jean and Divband Soorati, Mohammad and Ferrante, Eliseo and Kosak, Oliver and Montanier, Jean-Marc and Mostaghim, Sanaz and Redpath, Richard and Timmis, Jon and Veenstra, Frank and Wahby, Mostafa and Zamuda, Aleš},
issn = {2296-9144},
journal = {Frontiers in Robotics and AI},
title = {{Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems}},
doi = {10.3389/frobt.2016.00014},
year = {2016},
}
@article{19983,
author = {Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Ferrante, Eliseo},
journal = {Journal of Autonomous Agents and Multi-Agent Systems},
number = {3},
pages = {553--580},
title = {{Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems}},
doi = {10.1007/s10458-015-9323-3},
volume = {30},
year = {2016},
}
@inproceedings{20000,
author = {Hamann, Heiko and Valentini, Gabriele and Dorigo, Marco},
booktitle = {10th Int. Conf. on Swarm Intelligence, ANTS 2016},
isbn = {9783319444260},
issn = {0302-9743},
title = {{Population Coding: A New Design Paradigm for Embodied Distributed Systems}},
doi = {10.1007/978-3-319-44427-7_15},
year = {2016},
}
@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},
}
@misc{251,
author = {Pfannschmidt, Karlson},
publisher = {Universität Paderborn},
title = {{Solving the aggregated bandits problem}},
year = {2015},
}