@misc{4805, author = {{Dalkiran, Alpaslan}}, publisher = {{Universität Paderborn}}, title = {{{Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}}}, year = {{2018}}, } @misc{4806, author = {{Gräper, Gerrit}}, publisher = {{Universität Paderborn}}, title = {{{The Suitability of Equilibrium Concepts to evaluate competitive behaviour}}}, year = {{2018}}, } @misc{4807, author = {{Hammo, Hüssein}}, publisher = {{Universität Paderborn}}, title = {{{Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft}}}, year = {{2018}}, } @misc{4821, author = {{Brachmann, Jessica}}, publisher = {{Universität Paderborn}}, title = {{{Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}}}, year = {{2018}}, } @misc{4822, author = {{Förstenberg, Niklas}}, publisher = {{Universität Paderborn}}, title = {{{Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse}}}, year = {{2018}}, } @misc{4827, author = {{Khan, Zohaib Ahmad}}, publisher = {{Universität Paderborn}}, title = {{{How can choice sets be architectured to nudge People into certain decisions?}}}, year = {{2018}}, } @misc{4828, author = {{Kusch, Thomas}}, publisher = {{Universität Paderborn}}, title = {{{Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse}}}, year = {{2018}}, } @article{4982, author = {{Hoyer, Britta and Rosenkranz, Stephanie}}, journal = {{Games}}, number = {{4}}, publisher = {{MDPI}}, title = {{{ Determinants of Equilibrium Selection in Network Formation - An Experiment}}}, volume = {{9}}, year = {{2018}}, } @inproceedings{7570, author = {{Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}}, booktitle = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18}}, isbn = {{9781450357999}}, location = {{Vienna}}, publisher = {{ACM Press}}, title = {{{Brief Announcement: Communication in Systems of Home Based Mobile Agents}}}, doi = {{10.1145/3210377.3210662}}, year = {{2018}}, } @inproceedings{4351, abstract = {{ We extend the concept of monotonic searchability~\cite{DBLP:conf/opodis/ScheidelerSS15}~\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state. These kind of systems are most often used in distributed applications. Monotonic searchability provides guarantees when searching for nodes while the recovery process is going on. More precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well. Although there already exists a self-stabilizing protocol for a two-dimensional topology~\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively. The latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol. We propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability. Our protocol can easily be extended to higher dimensions and offers routing in $\mathcal O(\log n)$ hops for any search request. }}, author = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{16--31 }}, publisher = {{Springer, Cham}}, title = {{{Self-stabilizing Overlays for high-dimensional Monotonic Searchability}}}, doi = {{10.1007/978-3-030-03232-6_2}}, volume = {{11201}}, 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)}}, keywords = {{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{5222, abstract = {{We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. }}, author = {{Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}}, location = {{Tokyo, Japan}}, pages = {{50--64}}, publisher = {{Springer}}, title = {{{On Underlay-Aware Self-Stabilizing Overlay Networks}}}, volume = {{11201}}, year = {{2018}}, } @article{5330, abstract = {{In Internet transactions, customers and service providers often interact once and anonymously. To prevent deceptive behavior a reputation system is particularly important to reduce information asymmetries about the quality of the offered product or service. In this study we examine the effectiveness of a reputation system to reduce information asymmetries when customers may make mistakes in judging the provided service quality. In our model, a service provider makes strategic quality choices and short-lived customers are asked to evaluate the observed quality by providing ratings to a reputation system. The customer is not able to always evaluate the service quality correctly and possibly submits an erroneous rating according to a predefined probability. Considering reputation profiles of the last three sales, within the theoretical model we derive that the service provider’s dichotomous quality decisions are independent of the reputation profile and depend only on the probabilities of receiving positive and negative ratings when providing low or high quality. Thus, a service provider optimally either maintains a good reputation or completely refrains from any reputation building process. However, when mapping our theoretical model to an experimental design we find that a significant share of subjects in the role of the service provider deviates from optimal behavior and chooses actions which are conditional on the current reputation profile. With respect to these individual quality choices we see that subjects use milking strategies which means that they exploit a good reputation. In particular, if the sales price is high, low quality is delivered until the price drops below a certain threshold, and then high quality is chosen until the price increases again.}}, author = {{Mir Djawadi, Behnud and Fahr, Rene and Haake, Claus-Jochen and Recker, Sonja}}, issn = {{1932-6203}}, journal = {{PLoS ONE}}, number = {{11}}, publisher = {{Public Library of Science}}, title = {{{Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate}}}, doi = {{10.1371/journal.pone.0207172}}, volume = {{13}}, year = {{2018}}, } @misc{5368, author = {{Jochmaring, Moritz}}, publisher = {{Universität Paderborn}}, title = {{{Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}}}, year = {{2018}}, } @misc{5403, author = {{Geromel, Marcel}}, publisher = {{Universität Paderborn}}, title = {{{Mobile Facility Leasing}}}, year = {{2018}}, } @misc{5404, author = {{Kolpaczki, Patrick Irenäus}}, publisher = {{Universität Paderborn}}, title = {{{Online Algorithmen für das k-Page Migration Problem}}}, year = {{2018}}, } @misc{5422, author = {{Diemke, Viktoria}}, publisher = {{Universität Paderborn}}, title = {{{Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen}}}, 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}}, } @inproceedings{1060, abstract = {{With a growing number of online reviews, it becomes increasingly important for customers and online review platforms to find groups of reviewers who write useful reviews. Customers who review local offline businesses such as restaurants can identify themselves as locals or travelers and thus implicitly assign themselves to a specific reviewer group. This study investigates the relationship between identifying as a local and the perceived usefulness of their online reviews. Using data from Yelp.com, we empirically test hypotheses derived from attribution theory. Our results suggest that neutral and negative reviews by locals tend to be perceived as more useful than reviews by travelers. Positive reviews by locals, however, are not perceived as more useful. These findings provide significant practical implications for online review platforms and local offline businesses.}}, author = {{Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis and van Straaten, Dirk}}, booktitle = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}}, title = {{{When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews}}}, year = {{2018}}, } @inproceedings{1061, abstract = {{It is well-established that both average online ratings and the number of ratings positively impact product sales. Yet, the economic implications of the information contained in the online review texts is not that well understood. In this study, we contribute to the understanding of online review texts and its economic implications by conducting and validating an unsupervised machine learning algorithm, the latent dirichlet allocation, to identify online reviews that mention product failures. Furthermore, we show that the textual information on product failures are associated with lower product sales. Our results help online review system designers, e.g., amazon, to identify these reviews and to make them easily accessible to potential customers to support the customer’s purchasing decision. Academics can build on our results by applying our validated topic identification strategy and by linking reviews mentioning product failure to a range of different outcomes.}}, author = {{Gutt, Dominik}}, booktitle = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}}, title = {{{Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales}}}, year = {{2018}}, }