@phdthesis{200,
  author       = {{Drees, Maximilian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Existence and Properties of Pure Nash Equilibria in Budget Games}}},
  year         = {{2016}},
}

@misc{201,
  author       = {{Bröcher, Henrik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung}}},
  year         = {{2016}},
}

@phdthesis{202,
  author       = {{Dimant, Eugen}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics}}},
  year         = {{2016}},
}

@techreport{2570,
  abstract     = {{On an intermediate goods market we consider vertical and horizontal product differentiation and analyze the impact of simultaneous competition for resources and the demand of customers on the market outcome. Asymmetries between intermediaries may arise due to distinct product qualities as well as by reasons of different production technologies. The intermediaries compete on the output market by choosing production quantities sequentially and for the supplies of a monopolistic input supplier on the input market. It turns out that there exist differences in product quality and productivities such that an intermediary being the Stackelberg leader has no incentive to procure inputs, whereas in the role of the Stackelberg follower will participate in the market. Moreover, we find that given an intermediary is more competitive, his equilibrium output quantity is higher when being the leader than when being the follower. Interestingly, if the intermediary is less competitive and goods are complements, there may exist asymmetries such that an intermediary being in the position of the Stackelberg follower offers higher output quantities in equilibrium than when being in the position of the Stackelberg leader.}},
  author       = {{Manegold, Jochen}},
  keywords     = {{Input Market, Product Quality, Quantity Competition, Stackelberg Competition, Product Innovation}},
  publisher    = {{CIE Working Paper Series, Paderborn University}},
  title        = {{{Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation}}},
  volume       = {{98}},
  year         = {{2016}},
}

@misc{3308,
  author       = {{Breuer, Robin }},
  publisher    = {{Universität Paderborn}},
  title        = {{{Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse}}},
  year         = {{2016}},
}

@misc{3311,
  author       = {{Amedick, Michaela}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden}}},
  year         = {{2016}},
}

@article{3318,
  author       = {{Melnikov, Vitalik and Hüllermeier, Eyke and Kaimann, Daniel and Frick, Bernd  and Gupta,  Pritha }},
  issn         = {{2083-8476}},
  journal      = {{Schedae Informaticae}},
  publisher    = {{Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego}},
  title        = {{{Pairwise versus Pointwise Ranking: A Case Study}}},
  doi          = {{10.4467/20838476si.16.006.6187}},
  volume       = {{25}},
  year         = {{2016}},
}

@inproceedings{3157,
  author       = {{Beringer, Steffen and Wehrheim, Heike}},
  booktitle    = {{Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}},
  editor       = {{H. ter Beek, Maurice and Gnesi, Stefania and Knapp, Alexander}},
  pages        = {{189----204}},
  title        = {{{Verification of AUTOSAR Software Architectures with Timed Automata}}},
  doi          = {{10.1007/978-3-319-45943-1_13}},
  year         = {{2016}},
}

@misc{210,
  author       = {{Leder, Lennart}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Congestion Games with Mixed Objectives}}},
  year         = {{2016}},
}

@article{211,
  abstract     = {{On an intermediate goods market with asymmetric production technologies as well as vertical and horizontal product differentiation we analyze the influence of simultaneous competition for resources and customers. The intermediaries face either price or quantity competition on the output market and a monopolistic, strategically acting supplier on the input market. We find that there exist quality and productivity differences such that for quantity competition only one intermediary is willing to procure inputs from the input supplier, while for price competition both intermediaries are willing to purchase inputs. Moreover, the well-known welfare advantage of price competition can in general be no longer confirmed in our model with an endogenous input market and asymmetric intermediaries.}},
  author       = {{Brangewitz, Sonja and Manegold, Jochen}},
  journal      = {{Theoretical Economics Letters}},
  number       = {{6}},
  pages        = {{1341--1362}},
  publisher    = {{Scientific Research Publishing (SCIRP)}},
  title        = {{{Competition of Intermediaries in a Differentiated Duopoly}}},
  doi          = {{10.4236/tel.2016.66124}},
  volume       = {{6}},
  year         = {{2016}},
}

@phdthesis{212,
  author       = {{Manegold, Jochen}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Competition in Markets with Intermediaries}}},
  year         = {{2016}},
}

@misc{213,
  author       = {{Porzenheim, Laurens}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}}},
  year         = {{2016}},
}

@misc{214,
  author       = {{Bemmann, Kai Sören}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Commitment Schemes - Definitions, Variants, and Security}}},
  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}},
}

@inproceedings{216,
  abstract     = {{We empirically investigate the impact of successful goal achievement on future effort to attain the next goal in a recurring goal framework. We use data from a popular German Question & Answer community where goals are represented in the form of badges. In particular, our analysis of this data hinges on the fact, that in this Question & Answer community, badges in a hierarchical badge system are in-creasingly challenging to attain up to a certain badge. After this certain badge, the difficulty level sud-denly drops and remains constant throughout up to the last badge in the hierarchy. Our findings indi-cate that after successful badge achievement users increase their subsequent effort to attain the next badge, but only as long as badges represent a challenge to the user. According to our analysis, we identify self-learning to be the key driver of this behavior.}},
  author       = {{von Rechenberg, Tobias and Gutt, Dominik}},
  booktitle    = {{Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul}},
  location     = {{Istanbul, Turkey}},
  title        = {{{Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal's Difficulty}}},
  year         = {{2016}},
}

@misc{173,
  author       = {{Heck, Eduard}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace}}},
  year         = {{2016}},
}

@misc{174,
  author       = {{Schwentker, Christoph}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen}}},
  year         = {{2016}},
}

@article{175,
  abstract     = {{Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.}},
  author       = {{Walther, Sven and Wehrheim, Heike}},
  journal      = {{Science of Computer Programming}},
  pages        = {{2----23}},
  publisher    = {{Elsevier}},
  title        = {{{On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}}},
  doi          = {{10.1016/j.scico.2016.04.002}},
  year         = {{2016}},
}

@inproceedings{176,
  abstract     = {{Users prefer natural language software requirements because of their usability and accessibility. When they describe their wishes for software development, they often provide off-topic information. We therefore present an automated approach for identifying and semantically annotating the on-topic parts of the given descriptions. It is designed to support requirement engineers in the requirement elicitation process on detecting and analyzing requirements in user-generated content. Since no lexical resources with domain-specific information about requirements are available, we created a corpus of requirements written in controlled language by instructed users and uncontrolled language by uninstructed users. We annotated these requirements regarding predicate-argument structures, conditions, priorities, motivations and semantic roles and used this information to train classifiers for information extraction purposes. The approach achieves an accuracy of 92% for the on- and off-topic classification task and an F1-measure of 72% for the semantic annotation.}},
  author       = {{Dollmann, Markus and Geierhos, Michaela}},
  booktitle    = {{Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)}},
  location     = {{Austin, TX, USA}},
  pages        = {{1807--1816}},
  publisher    = {{Association for Computational Linguistics (ACL)}},
  title        = {{{On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements}}},
  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}},
}