@misc{178, author = {{Endres, Angelika Elfriede}}, publisher = {{Universität Paderborn}}, title = {{{On the Design and Defense of Networks - An Experimental Investigation}}}, year = {{2016}}, } @misc{179, author = {{Pehlivan, Muhammet}}, publisher = {{Universität Paderborn}}, title = {{{On the abuse of market power - an economic perspective of Microsoft antitrust cases}}}, 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}}, } @article{190, abstract = {{Today, software components are provided by global markets in the form of services. In order to optimally satisfy service requesters and service providers, adequate techniques for automatic service matching are needed. However, a requester’s requirements may be vague and the information available about a provided service may be incomplete. As a consequence, fuzziness is induced into the matching procedure. The contribution of this paper is the development of a systematic matching procedure that leverages concepts and techniques from fuzzy logic and possibility theory based on our formal distinction between different sources and types of fuzziness in the context of service matching. In contrast to existing methods, our approach is able to deal with imprecision and incompleteness in service specifications and to inform users about the extent of induced fuzziness in order to improve the user’s decision-making. We demonstrate our approach on the example of specifications for service reputation based on ratings given by previous users. Our evaluation based on real service ratings shows the utility and applicability of our approach.}}, author = {{Platenius, Marie Christin and Shaker, Ammar and Becker, Matthias and Hüllermeier, Eyke and Schäfer, Wilhelm}}, journal = {{IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017}}, number = {{8}}, pages = {{739--759}}, publisher = {{IEEE}}, title = {{{Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic}}}, doi = {{10.1109/TSE.2016.2632115}}, year = {{2016}}, } @inproceedings{191, abstract = {{One purpose of requirement refinement is that higher-level requirements have to be translated to something usable by developers. Since customer requirements are often written in natural language by end users, they lack precision, completeness and consistency. Although user stories are often used in the requirement elicitation process in order to describe the possibilities how to interact with the software, there is always something unspoken. Here, we present techniques how to automatically refine vague software descriptions. Thus, we can bridge the gap by first revising natural language utterances from higher-level to more detailed customer requirements, before functionality matters. We therefore focus on the resolution of semantically incomplete user-generated sentences (i.e. non-instantiated arguments of predicates) and provide ontology-based gap-filling suggestions how to complete unverbalized information in the user’s demand.}}, author = {{Geierhos, Michaela and Bäumer, Frederik Simon}}, booktitle = {{Proceedings of the 21st International Conference on Applications of Natural Language to Information Systems (NLDB)}}, editor = {{Métais, Elisabeth and Meziane, Farid and Saraee, Mohamad and Sugumaran, Vijayan and Vadera, Sunil }}, isbn = {{978-3-319-41753-0}}, keywords = {{Requirement refinement, Concept expansion, Ontology-based instantiation of predicate-argument structure}}, location = {{Salford, UK}}, pages = {{37--47}}, publisher = {{Springer}}, title = {{{How to Complete Customer Requirements: Using Concept Expansion for Requirement Refinement}}}, doi = {{10.1007/978-3-319-41754-7_4}}, volume = {{9612}}, year = {{2016}}, } @misc{192, author = {{Reckhorn, Lena}}, publisher = {{Universität Paderborn}}, title = {{{Herausforderungen im Umgang mit unvollständigen Softwareanforderungen durch Semantic Role Labeling}}}, year = {{2016}}, } @article{193, abstract = {{Heath et al. (1999) propose a prospect theory model for goal behavior. Their analytical model is based on the assumption that goals inherit the main properties of the prospect theory value function, i.e., reference point dependence, loss aversion, and diminishing sensitivity. We investigate whether these main properties transfer to goal behavior in the field. We take user activity data from a gamified Question & Answer community and analyze how users adjust their contribution behavior in the days surrounding goal achievement, where goals are represented by badges. We find that users gradually increase their performance in the days prior to earning a badge, with performance peaking on the day of the promotion. In subsequent days, user performance gradually diminishes again, with the decline being strongest on the day immediately following the badge achievement. These findings reflect the characteristic S-shape of the prospect theory value function which is convex below the reference point and concave above it. Employing the target-based approach, we can interpret the value function as a cumulative density function of a unimodal probability distribution. Our results suggest that it is more likely that active members of the community focus on the next badge relative to the status already achieved, as their next goal and are less likely to focus on more remote (higher-ranked) badges. Our results thus support the transferability of the main properties of the prospect theory value function to goal behavior in the field and suggest a distinct shape of the value function around goals.}}, author = {{von Rechenberg, Tobias and Gutt, Dominik and Kundisch, Dennis}}, journal = {{Decision Analysis}}, number = {{2}}, pages = {{153----171}}, publisher = {{INFORMS}}, title = {{{Goals as Reference Points: Empirical Evidence from a Virtual Reward System}}}, doi = {{10.1287/deca.2016.0331}}, year = {{2016}}, } @misc{194, author = {{Sassenberg, Tristan}}, publisher = {{Universität Paderborn}}, title = {{{Gefälschte Online Bewertungen - Literaturüberblick}}}, year = {{2016}}, } @inproceedings{203, abstract = {{We analyse the economic interaction on the market for composed services. Typically, as providers of composed services, intermediaries interact on the sales side with users and on the procurement side with providers of single services. Thus, in how far a user request can be met often crucially depends on the prices and qualities of the different single services used in the composition. We study an intermediary who purchases two complementary single services and combines them. The prices paid to the service providers are determined by simultaneous multilateral Nash bargaining between the intermediary and the respective service provider. By using a function with constant elasticity of substitution (CES) to determine the quality of the composed service, we allow for complementary as well as substitutable degrees of the providers' service qualities. We investigate quality investments of service providers and the corresponding evolution of the single service quality within a differential game framework. }}, author = {{Brangewitz, Sonja and Hoof, Simon}}, booktitle = {{Service-Oriented and Cloud Computing: 5th IFIP WG 2.14 European Conference, ESOCC 2016, Vienna, Austria, September 5-7, 2016, Proceedings}}, editor = {{Marco Aiello, Einar Broch Johnsen, Schahram Dustdar, and Georgievski, Ilche}}, pages = {{201--215}}, title = {{{Economic Aspects of Service Composition: Price Negotiations and Quality Investments}}}, doi = {{10.1007/978-3-319-44482-6_13}}, year = {{2016}}, } @misc{204, author = {{Funke, Julia}}, publisher = {{Universität Paderborn}}, title = {{{Die Wirkung von monetären Incentives auf das Bewertungsverhalten von Kunden am Beispiel von meineLinse.de}}}, year = {{2016}}, } @inproceedings{205, author = {{Herrmann, Philipp and Gutt, Dominik and Rahman, Mohammad}}, booktitle = {{INFORMS Annual Meeting}}, location = {{Nashville, USA}}, title = {{{Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Structure and Online Rating Distributions}}}, year = {{2016}}, } @inproceedings{206, author = {{Herrmann, Philipp and Gutt, Dominik and Rahman, Mohammad}}, booktitle = {{NBER Summer Institute on the Economics of Information Technology and Digitization}}, location = {{Cambridge, MA, USA}}, title = {{{Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Structure and Online Rating Distributions}}}, 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}}, } @inproceedings{208, abstract = {{This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.}}, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the CT-RSA 2016}}, pages = {{431--447}}, title = {{{Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}}}, doi = {{10.1007/978-3-319-29485-8_25}}, 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}}, } @inproceedings{180, abstract = {{Recent literature reports concerns about implausibly high Overall ratings in the sharing economy, which undermines the credibility of this rating as a quality signal. This study empirically investigates the relationship between quality and price, commonly captured by the Value dimension in multidimensional rating systems, to reveal whether reviewers form a perception of quality that they then express in the Value dimension, rather than in the Overall rating. We test our hypotheses on a comprehensive panel dataset for 14,859 Airbnb listings in New York. Our preliminary empirical findings show that an increase in price leads to a significant and substantial decrease in the Value rating, suggesting that Value ratings can offer a valuable source of information for potential buyers in addition to the supposedly inflated Overall rating. Moreover, this mechanism has substantial implications for potential buyers who seek to evaluate a listing’s quality and for a seller’s price setting. }}, author = {{Gutt, Dominik and Kundisch, Dennis}}, booktitle = {{Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland}}, location = {{Dublin, Ireland}}, title = {{{Money Talks (Even) in the Sharing Economy: Empirical Evidence for Price Effects in Online Ratings as Quality Signals}}}, year = {{2016}}, } @misc{181, author = {{Stanco, Stefan}}, publisher = {{Universität Paderborn}}, title = {{{Modellierung von domänenspezifischen Ontologien im Anwendungsfall funktionaler Softwareanforderungen}}}, year = {{2016}}, } @misc{182, author = {{Kesmen, Belma}}, publisher = {{Universität Paderborn}}, title = {{{Marktmissbrauch in der Internetökonomie - Eine wettbewerbspolitische Analyse}}}, year = {{2016}}, } @misc{183, author = {{Jubrail, Ari}}, publisher = {{Universität Paderborn}}, title = {{{Literaturüberblick zur Varianz in Kundenbewertungen auf Online Plattformen}}}, year = {{2016}}, } @inproceedings{184, abstract = {{In this paper, we propose a framework for a class of learning problems that we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems are supervised machine learning problems, in which instances are represented in the form of a composition of a (variable) number on constituents; such compositions are associated with an evaluation, score, or label, which is the target of the prediction task, and which can presumably be modeled in the form of a suitable aggregation of the properties of its constituents. Our learning-to-aggregate framework establishes a close connection between machine learning and a branch of mathematics devoted to the systematic study of aggregation functions. We specifically focus on a class of functions called uninorms, which combine conjunctive and disjunctive modes of aggregation. Experimental results for a corresponding model are presented for a review data set, for which the aggregation problem consists of combining different reviewer opinions about a paper into an overall decision of acceptance or rejection.}}, author = {{Melnikov, Vitaly and Hüllermeier, Eyke}}, booktitle = {{Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)}}, pages = {{756--771}}, title = {{{Learning to Aggregate Using Uninorms}}}, doi = {{10.1007/978-3-319-46227-1_47}}, year = {{2016}}, }