@article{7800, author = {{Henksmeier, Tobias and Shvarkov, Stepan and Trapp, Alexander and Reuter, Dirk}}, issn = {{0022-0248}}, journal = {{Journal of Crystal Growth}}, pages = {{164--168}}, publisher = {{Elsevier BV}}, title = {{{Molecular beam epitaxy growth and temperature-dependent electrical characterization of carbon-doped GaAs on GaAs(1 1 1)B}}}, doi = {{10.1016/j.jcrysgro.2019.02.006}}, volume = {{512}}, year = {{2019}}, } @article{80, abstract = {{Models on network formation have often been extended to include the potential of network disruption in recent years. Whereas the theoretical research on network formation under the threat of disruption has thus gained prominence, hardly any experimental research exists so far. In this paper, we therefore experimentally study the emergence of networks including the aspect of a known external threat by relating theoretical predictions by Dzuibiński and Goyal (2013) to actual observed behaviour. We deal with the question if subjects in the role of a strategic Designer are able to form safe networks for least costs while facing a strategic Adversary who is going to attack their networks. Varying the costs for protecting nodes, we designed and tested two treatments with different predictions for the equilibrium network and investigated whether one of the least cost equilibrium networks was more likely to be reached. Furthermore, the influence of the subjects’ farsightedness on their decision-making process was elicited and analysed. We find that while subjects are able to build safe networks in both treatments, equilibrium networks are only built in one of the two treatments. In the other treatment, predominantly safe networks are built but they are not for least costs. Additionally, we find that farsightedness –as measured in our experiment– has no influence on whether subjects are able to build safe or least cost equilibrium networks. Two robustness settings with a reduced external threat or more liberties to modify the initial networks qualitatively confirm our results. Overall, in this experiment observed behaviour is only partially in line with the theoretical predictions by Dzuibiński and Goyal (2013).}}, author = {{Endres, Angelika Elfriede and Recker, Sonja and Mir Djawadi, Behnud and Hoyer, Britta}}, journal = {{Journal of Economic Behavior and Organization }}, pages = {{708--734}}, title = {{{Network Formation and Disruption - An Experiment: Are equilibrium networks too complex?}}}, doi = {{10.1016/j.jebo.2018.11.004}}, volume = {{157}}, year = {{2019}}, } @phdthesis{8080, abstract = {{This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.}}, author = {{Feldotto, Matthias}}, title = {{{Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}}}, doi = {{10.17619/UNIPB/1-588}}, year = {{2019}}, } @misc{8112, author = {{Maaz, Mohammad Urf and Sprenger, Alexander and Hellebrand, Sybille}}, keywords = {{WORKSHOP}}, publisher = {{31. Workshop "Testmethoden und Zuverlässigkeit von Schaltungen und Systemen" (TuZ'19)}}, title = {{{A Hybrid Space Compactor for Varying X-Rates}}}, year = {{2019}}, } @article{8113, abstract = {{The ongoing softwarization of networks creates a big need for automated testing solutions to ensure service quality. This becomes even more important if agile environments with short time to market and high demands, in terms of service performance and availability, are considered. In this paper, we introduce a novel testing solution for virtualized, microservice-based network functions and services, which we base on TTCN-3, a well known testing language defined by the European standards institute (ETSI). We use TTCN-3 not only for functional testing but also answer the question whether TTCN-3 can be used for performance profiling tasks as well. Finally, we demonstrate the proposed concepts and solutions in a case study using our open-source prototype to test and profile a chained network service.}}, author = {{Peuster, Manuel and Dröge, Christian and Boos, Clemens and Karl, Holger}}, issn = {{2405-9595}}, journal = {{ICT Express}}, publisher = {{Elsevier BV}}, title = {{{Joint testing and profiling of microservice-based network services using TTCN-3}}}, doi = {{10.1016/j.icte.2019.02.001}}, year = {{2019}}, } @inproceedings{8240, author = {{Dräxler, Sevil and Karl, Holger}}, booktitle = {{5th IEEE International Conference on Network Softwarization (NetSoft) 2019}}, location = {{Paris}}, title = {{{SPRING: Scaling, Placement, and Routing of Heterogeneous Services with Flexible Structures}}}, year = {{2019}}, } @misc{8312, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{encyclopedia.pub}}, keywords = {{OTF Computing, Natural Language Processing, Requirements Engineering}}, publisher = {{MDPI}}, title = {{{Requirements Engineering in OTF-Computing}}}, year = {{2019}}, } @article{5674, abstract = {{In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{European Journal of Operational Research}}, keywords = {{OR in disaster relief, disaster operations management, scheduling, branch-and-price}}, number = {{1}}, pages = {{352 -- 363}}, publisher = {{Elsevier}}, title = {{{An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}}}, volume = {{272}}, year = {{2019}}, } @inproceedings{4517, author = {{Wolf, Verena and Bartelheimer, Christian and Beverungen, Daniel}}, booktitle = {{Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS-52)}}, location = {{Maui, Hawaii}}, title = {{{Digitalization of Work Systems—An Organizational Routines’ Perspective}}}, year = {{2019}}, } @article{4561, abstract = {{We exploit a unique sample of structured financial products (SFPs) to analyze pricing and issuance dependencies among different types of such market‐linked investment vehicles. Our study provides evidence of cross‐pricing between products with complementary payoff profiles. Such dependencies may be explained by issuers’ efforts to generate order flow for products that supplement their current SFP risk exposure. Additionally, we observe issuance patterns in line with the argument that issuers exploit the complementarity payout profiles when bringing SFPs to market. Our study emphasizes cross‐pricing from a perspective not previously considered in the literature.}}, author = {{Pelster, Matthias and Schertler, Andrea}}, journal = {{Journal of Futures Markets}}, keywords = {{cross‐pricing, discount certificate, hedging, issuance decisions, put warrants, structured financial products}}, number = {{3}}, pages = {{342--365}}, title = {{{Pricing and issuance dependencies in SFP portfolios}}}, doi = {{10.1002/fut.21978}}, volume = {{39}}, year = {{2019}}, } @article{4682, author = {{Schmiedel, T. and Müller, Oliver and vom Brocke, J.}}, journal = {{Organizational Research Methods}}, keywords = {{online reviews, organizational culture, structural topic model, topic modeling, tutorial}}, pages = {{941----968 }}, title = {{{Topic Modeling as a Strategy of Inquiry in Organizational Research: A Tutorial With an Application Example on Organizational Culture}}}, doi = {{https://doi.org/10.1177/1094428118773858}}, year = {{2019}}, } @inbook{4798, author = {{Harteis, Christian}}, booktitle = {{Work-based learning as a pathway to competence-based education}}, editor = {{Bahl, Anke and Dietzen, Anke}}, pages = {{85--97}}, publisher = {{Barbara Budrich}}, title = {{{Supporting learning at work in an era of digitalization of work}}}, year = {{2019}}, } @article{7413, author = {{Gutt, Dominik and Neumann, Jürgen and Zimmermann, Steffen and Kundisch, Dennis and Chen, J.}}, journal = {{Journal of Strategic Information Systems}}, number = {{2}}, pages = {{104--117}}, title = {{{Design of Review Systems – A Strategic Instrument to shape Online Reviewing Behavior and Economic Outcomes}}}, volume = {{28}}, year = {{2019}}, } @inbook{7430, author = {{Rittmeier, Florian and Engels, Gregor and Teetz, Alexander}}, booktitle = {{Business Process Management Workshops}}, editor = {{Daniel, Florian and Sheng, Quan Z. and Motahari, Hamid}}, isbn = {{9783030116408}}, issn = {{1865-1348}}, pages = {{531--542}}, publisher = {{Springer International Publishing}}, title = {{{Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes}}}, doi = {{10.1007/978-3-030-11641-5_42}}, volume = {{342}}, year = {{2019}}, } @inbook{7465, author = {{Kremer, H.-Hugo}}, booktitle = {{Berufsbildung zwischen Tradition und Moderne}}, editor = {{Pilz, M. and Breuing, K. and Schumann, S.}}, title = {{{Praxissemester und Professionalisierung - Überlegungen zur Gestaltung einer universitären Begleitkonzeption}}}, year = {{2019}}, } @techreport{7622, author = {{Kundisch, Dennis and Beverungen, Daniel}}, pages = {{22--26}}, title = {{{Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten}}}, year = {{2019}}, } @misc{7623, author = {{Zhang, Shikun}}, pages = {{64}}, publisher = {{Universität Paderborn}}, title = {{{Combining Android Apps for Analysis Purposes}}}, year = {{2019}}, } @misc{7628, author = {{Selbach, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Modeling Crypto API usages in OpenSSL's EVP library}}}, year = {{2019}}, } @techreport{7630, abstract = {{In this paper, we analyze a credence goods model adjusted to the health care market with regulated prices and heterogeneous experts. Experts are physicians and are assumed to differ in their cost of treating a small problem. We investigate the effects of this heterogeneity on the physicians’ level of fraud and on the patients’ search for second opinions. We find that introducing a fraction of more efficient low-cost physicians always increases social welfare, but in some cases only because of the raised physicians’ surplus. When the low-cost physicians’ cost advantage is small, imposing a share of low-cost physicians does not change the equilibrium fraud level. When the cost advantage is large, however, different changes in the fraud level occur depending on the share of generated low-cost physicians, the search rate and the initial level of fraud.}}, author = {{Heinzel, Joachim Maria Josef}}, keywords = {{credence goods, treatment efficiency, heterogeneous experts, overcharging}}, publisher = {{CIE Working Paper Series}}, title = {{{Credence Goods Markets with Heterogeneous Experts}}}, volume = {{118}}, year = {{2019}}, } @inproceedings{7635, author = {{Sharma, Arnab and Wehrheim, Heike}}, booktitle = {{IEEE International Conference on Software Testing, Verification and Validation (ICST)}}, location = {{Xi'an, China, April, 2019}}, pages = {{125----135}}, publisher = {{IEEE}}, title = {{{Testing Machine Learning Algorithms for Balanced Data Usage}}}, year = {{2019}}, }