@article{13148, abstract = {{This paper examines the evolutionary stability of behaviour in contests where players’ participation can be stochastic. We find, for exogenously given participation probabilities, players exert more effort under the concept of a finite-population evolutionarily stable strategy (FPESS) than under Nash equilibrium (NE). We show that there is ex-ante overdissipation under FPESS for sufficiently large participation probabilities, if, and only if, the impact function is convex. With costly endogenous entry, players enter the contest with a higher probability and exert more effort under FPESS than under NE. Importantly, under endogenous entry, overdissipation can occur for all (Tullock) contest success functions, in particular those with concave impact functions.}}, author = {{Gu, Yiquan and Hehenkamp, Burkhard and Leininger, Wolfgang}}, issn = {{0167-2681}}, journal = {{Journal of Economic Behavior & Organization}}, pages = {{469--485}}, title = {{{Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation}}}, doi = {{10.1016/j.jebo.2019.06.011}}, year = {{2019}}, } @inproceedings{13182, abstract = {{We consider congestion control in peer-to-peer distributed systems. The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper). We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped. The server can modify these probabilities when clients send messages. Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$. We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state. Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$. This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation. In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values. Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight. Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor). }}, author = {{Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{149--164}}, publisher = {{Springer, Cham}}, title = {{{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}}}, doi = {{https://doi.org/10.1007/978-3-030-34992-9_13}}, year = {{2019}}, } @inproceedings{13292, abstract = {{Building on 5G and network function virtualization (NFV), smart manufacturing has the potential to drastically increase productivity, reduce cost, and introduce novel, flexible manufacturing services. Current work mostly focuses on high-level scenarios or emulation-based prototype deployments. Extending our previous work, we showcase one of the first cloud-native 5G verticals focusing on the deployment of smart manufacturing use cases on production infrastructure. In particular, we use the 5GTANGO service platform to deploy our developed network services on Kubernetes. For this demo, we implemented a series of cloud-native virtualized network functions (VNFs) and created suitable service descriptors. Their light-weight, stateless deployment on Kubernetes enables quick instantiation, scalability, and robustness.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track}}, keywords = {{5G, NFV, Smart Manufacturing, Cloud-Native, Kubernetes}}, location = {{Dallas, TX, USA}}, publisher = {{IEEE}}, title = {{{"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes}}}, year = {{2019}}, } @misc{13435, author = {{Friesen, Edwin}}, publisher = {{Universität Paderborn}}, title = {{{Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis}}}, year = {{2019}}, } @inproceedings{10093, author = {{Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}}, booktitle = {{Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}}, editor = {{Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, Stefan}}, pages = {{151----152}}, publisher = {{GI}}, title = {{{Combining Verifiers in Conditional Model Checking via Reducers}}}, doi = {{10.18420/se2019-46}}, volume = {{P-292}}, year = {{2019}}, } @inproceedings{10095, author = {{Richter, Cedric and Wehrheim, Heike}}, booktitle = {{Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}}}, editor = {{Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, Bernhard}}, pages = {{229--233}}, publisher = {{Springer}}, title = {{{PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}}}, doi = {{10.1007/978-3-030-17502-3_19}}, volume = {{11429}}, year = {{2019}}, } @misc{10105, author = {{Haltermann, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Analyzing Data Usage in Array Programs}}}, year = {{2019}}, } @inproceedings{10232, abstract = {{Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with.}}, author = {{Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}}, location = {{Long Beach, CA, USA}}, title = {{{Automating Multi-Label Classification Extending ML-Plan}}}, year = {{2019}}, } @misc{10271, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}}}, year = {{2019}}, } @misc{10277, author = {{Althaus, Steffen}}, title = {{{Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry}}}, year = {{2019}}, } @inproceedings{10281, abstract = {{Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare.}}, author = {{Feldotto, Matthias and Lenzner, Pascal and Molitor, Louise and Skopalik, Alexander}}, booktitle = {{Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}}, location = {{Montreal QC, Canada}}, pages = {{1949----1951}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}}}, year = {{2019}}, } @phdthesis{10290, author = {{Gutt, Dominik}}, title = {{{Essays on Drivers and Economic Outcomes of Online-Reviews}}}, doi = {{10.17619/UNIPB/1-688}}, year = {{2019}}, } @article{10325, author = {{Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and Karl, Holger}}, issn = {{1687-1499}}, journal = {{EURASIP Journal on Wireless Communications and Networking}}, publisher = {{Springer}}, title = {{{Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing}}}, doi = {{10.1186/s13638-019-1493-2}}, year = {{2019}}, } @techreport{10332, abstract = {{We analyze the incentives for retail bundling and the welfare effects of retail bundling in a decentralized distribution channel with two retailers and two monopolistic manufacturers. One manufacturer exclusively sells his good to one retailer, whereas the other manufacturer sells his good to both retailers. Thus, one retailer is a monopolist for one product but competes with the other retailer in the second product market. The two-product retailer has the option to bundle his goods or to sell them separately. We find that bundling aggravates the double marginalization problem for the bundling retailer. Nevertheless, when the retailers compete in prices, bundling can be more profitable than separate selling for the retailer as bundling softens the retail competition. The ultimate outcome depends on the manufacturers’ marginal costs. Given retail quantity competition, however, bundling is in no case the retailer’s best strategy. Furthermore, we show that profitable bundling reduces consumer and producer surplus in the equilibrium.}}, author = {{Heinzel, Joachim Maria Josef}}, keywords = {{retail bundling, leverage theory, double marginalization}}, publisher = {{CIE Working Paper Series}}, title = {{{Bundling in a Distribution Channel with Retail Competition}}}, year = {{2019}}, } @misc{10344, author = {{Pukrop, Simon}}, publisher = {{Universität Paderborn}}, title = {{{Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}}}, year = {{2019}}, } @inproceedings{13586, author = {{Seutter, Janina and Neumann, Jürgen}}, booktitle = {{Proceedings of the 40th International Conference on Information Systems (ICIS)}}, location = {{Munich, Germany}}, title = {{{Head over Feels? Differences in Online Rating Behavior for Utilitarian and Hedonic Service Aspects}}}, year = {{2019}}, } @inproceedings{13587, author = {{Gutt, Dominik and Neumann, Jürgen and Jabr, W. and Kundisch, Dennis}}, booktitle = {{Proceedings of the 40th International Conference on Information Systems (ICIS)}}, location = {{Munich, Germany}}, title = {{{The App Updating Conundrum: Implications of Platform’s Rating Resetting on Developers’ Behavior}}}, year = {{2019}}, } @misc{13592, author = {{Pilot, Matthias}}, publisher = {{Universität Paderborn}}, title = {{{Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java}}}, year = {{2019}}, } @misc{13648, author = {{Scholz, Swante}}, publisher = {{Universität Paderborn}}, title = {{{Implementation and Comparison of Elliptic Curve Algorithms in Java}}}, year = {{2019}}, } @inproceedings{13652, author = {{Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}}, booktitle = {{33rd International Symposium on Distributed Computing (DISC 2019)}}, title = {{{Fast Distributed Algorithms for LP-Type Problems of Low Dimension}}}, doi = {{10.4230/LIPICS.DISC.2019.23}}, year = {{2019}}, }