@inproceedings{22014, author = {{Seutter, Janina and Müller, Michelle and Neumann, Jürgen and Kundisch, Dennis}}, location = {{Virtual Conference/Workshop}}, publisher = {{Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021)}}, title = {{{Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community}}}, year = {{2021}}, } @inproceedings{23411, author = {{Müller, Michelle and Neumann, Jürgen and Kundisch, Dennis}}, location = {{Newport Beach, California, USA}}, title = {{{Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies}}}, year = {{2021}}, } @inproceedings{19782, author = {{Müller, Michelle and Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}}, booktitle = {{Proceedings of the 41th International Conference on Information Systems (ICIS)}}, location = {{Virtual Conference/Workshop}}, title = {{{Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies}}}, year = {{2020}}, } @misc{20221, author = {{Yeole, Paresh Kishor}}, title = {{{Plurality Consensus in Hybrid Networks}}}, year = {{2020}}, } @phdthesis{20240, author = {{Hoof, Simon}}, title = {{{Essays on Cooperation in Differential Games}}}, doi = {{ 10.17619/UNIPB/1-1047}}, year = {{2020}}, } @article{2834, author = {{Gutt, Dominik and von Rechenberg, Tobias and Kundisch, Dennis}}, journal = {{Journal of Business Research}}, pages = {{277--287}}, publisher = {{Elsevier}}, title = {{{Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty}}}, doi = {{10.1016/j.jbusres.2018.06.019}}, volume = {{106}}, year = {{2020}}, } @article{21287, abstract = {{Peer-to-peer markets are especially suitable for the analysis of online ratings as they represent two-sided markets that match buyers to sellers and thus lead to reduced scope for opportunistic behavior. We decompose the online ratings by focusing on the customer’s decision-making process in a leading peer-to-peer ridesharing platform. Using data from the leading peer-to-peer ridesharing platform BlaBlaCar, we analyze 17,584 users registered between 2004 and 2014 and their online ratings focusing on the decomposition of the explicit determinants reflecting the variance of online ratings. We find clear evidence to suggest that a driver’s attitude towards music, pets, smoking, and conversation has a significantly positive influence on his received online ratings. However, we also show that the interaction of female drivers and their attitude towards pets has a significantly negative effect on average ratings.}}, author = {{Kaimann, Daniel}}, issn = {{2071-1050}}, journal = {{Sustainability}}, number = {{15}}, title = {{{Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets}}}, doi = {{10.3390/su12156185}}, volume = {{12}}, year = {{2020}}, } @inproceedings{17370, abstract = {{ We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \( S \) of commodities. Ravi and Sinha (SODA 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem. The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances. In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$. A request has to be connected to a set of facilities jointly offering the commodities demanded by it. In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each. To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time. We present results regarding the competitive ratio. On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega ( \sqrt{|S|} + \frac{\log n}{\log \log n} ) \) that already holds for simple line metrics. Here, \( n \) is the number of requests. On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm. Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.}}, author = {{Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}}, isbn = {{9781450369350}}, keywords = {{Online Multi-Commodity Facility Location, Competitive Ratio, Online Optimization, Facility Location Problem}}, title = {{{The Online Multi-Commodity Facility Location Problem}}}, doi = {{10.1145/3350755.3400281}}, year = {{2020}}, } @proceedings{17836, editor = {{Werneck Richa, Andrea and Scheideler, Christian}}, isbn = {{978-3-030-54920-6}}, publisher = {{Springer}}, title = {{{Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}}}, doi = {{10.1007/978-3-030-54921-3}}, volume = {{12156}}, year = {{2020}}, } @proceedings{17839, editor = {{Scheideler, Christian and Spear, Michael}}, isbn = {{978-1-4503-6935-0}}, publisher = {{ACM}}, title = {{{SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}}}, doi = {{10.1145/3350755}}, year = {{2020}}, } @misc{20495, author = {{Jochmaring, Moritz}}, title = {{{A self stabilizing protocol for well-formed trees in hybrid networks}}}, year = {{2020}}, } @inproceedings{20755, abstract = {{We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely. We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model. Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest. }}, author = {{Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}}, booktitle = {{Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}}}, doi = {{10.4230/LIPIcs.OPODIS.2020.31}}, year = {{2020}}, } @misc{18066, author = {{Skowronek, Michael}}, publisher = {{Universität Paderborn}}, title = {{{Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}}}, year = {{2020}}, } @misc{18648, author = {{Guggenmos, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}}}, year = {{2020}}, } @article{4627, author = {{Kaimann, Daniel}}, journal = {{Applied Economics Letters}}, number = {{16}}, pages = {{1366--1370}}, title = {{{Ancillary market signaling: A two-stage model of economic reputation on ancillary market success}}}, doi = {{10.1080/13504851.2019.1683136}}, volume = {{27}}, year = {{2020}}, } @article{16902, abstract = {{The maintenance of efficient and robust overlay networks is one of the most fundamental and reoccurring themes in networking. This paper presents a survey of state-of-the-art algorithms to design and repair overlay networks in a distributed manner. In particular, we discuss basic algorithmic primitives to preserve connectivity, review algorithms for the fundamental problem of graph linearization, and then survey self-stabilizing algorithms for metric and scalable topologies. We also identify open problems and avenues for future research. }}, author = {{Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}}, journal = {{ACM Computing Surveys}}, publisher = {{ACM}}, title = {{{Survey on Algorithms for Self-Stabilizing Overlay Networks}}}, doi = {{10.1145/3397190}}, year = {{2020}}, } @phdthesis{16910, author = {{Stroh-Maraun, Nadja}}, publisher = {{Universität Paderborn}}, title = {{{Mechanisms, Preferences, and Heterogeneity in Matching Markets}}}, doi = {{10.17619/UNIPB/1-958}}, year = {{2020}}, } @inproceedings{16951, author = {{Seutter, Janina and Neumann, Jürgen}}, booktitle = {{Proceedings of the 28th European Conference on Information Systems (ECIS)}}, location = {{Virtual Conference/Workshop}}, title = {{{Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior}}}, year = {{2020}}, } @inproceedings{16952, author = {{Poniatowski, Martin and Neumann, Jürgen}}, booktitle = {{Proceedings of the 28th European Conference on Information Systems (ECIS)}}, location = {{Virtual Conference/Workshop}}, title = {{{Getting Personal with Review Systems – Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior}}}, year = {{2020}}, } @phdthesis{15631, author = {{Feldkord, Björn}}, title = {{{Mobile Resource Allocation}}}, doi = {{10.17619/UNIPB/1-869}}, year = {{2020}}, }