@inproceedings{4563, abstract = {{Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion. In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work. }}, author = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}}, booktitle = {{Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }}, keywords = {{greedy routing, ad hoc networks, convex hulls, c-competitiveness}}, location = {{Helsinki}}, publisher = {{Springer}}, title = {{{Competitive Routing in Hybrid Communication Networks}}}, year = {{2018}}, } @article{4564, abstract = {{ In our model two divisions negotiate over type-dependent contracts to determine an intrafirm transfer price for an intermediate product. Since the upstream division's (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information, we formally consider cooperative bargaining problems under incomplete information. This means that the two divisions consider allocations of expected utility generated by mechanisms that satisfy (interim) individual rationality, incentive compatibility and/or ex post efficiency. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether or not incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine fair transfer payments and transfer quantities. In particular, the generalized Nash bargaining solution tries to balance divisional profits, while incentive constraints are still in place. In that sense a fair profit division is generated. Furthermore, by means of illustrative examples we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the models existing in the literature. We demonstrate that there is a tradeoff between ex post efficiency and fairness. }}, author = {{Haake, Claus-Jochen and Recker, Sonja}}, journal = {{Group Decision and Negotiation}}, number = {{6}}, pages = {{905--932}}, publisher = {{Springer}}, title = {{{The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}}}, doi = {{10.1007/s10726-018-9592-8}}, volume = {{27}}, year = {{2018}}, } @inproceedings{4565, author = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}}, booktitle = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, isbn = {{9781450357999}}, location = {{Wien}}, publisher = {{ACM Press}}, title = {{{Brief Announcement: Competitive Routing in Hybrid Communication Networks}}}, doi = {{10.1145/3210377.3210663}}, year = {{2018}}, } @inproceedings{4577, author = {{Bohn, Nicolai and Kundisch, Dennis}}, booktitle = {{Proceedings of the 39th International Conference on Information Systems (ICIS)}}, location = {{San Francisco, USA}}, title = {{{An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model}}}, year = {{2018}}, } @phdthesis{4797, author = {{Wu, Xing}}, publisher = {{Universität Paderborn}}, title = {{{Essays on Competition in Health Care Markets}}}, doi = {{10.17619/UNIPB/1-358}}, year = {{2018}}, } @misc{4802, author = {{Akcay, Yasemen}}, publisher = {{Universität Paderborn}}, title = {{{Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}}}, year = {{2018}}, } @misc{4804, author = {{Görken, Emre}}, publisher = {{Universität Paderborn}}, title = {{{Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern}}}, year = {{2018}}, } @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{4339, abstract = {{On-The-Fly Computing is the vision of covering software needs of end users by fully-automatic compositions of existing software services. End users will receive so-called service compositions tailored to their very individual needs, based on natural language software descriptions. This everyday language may contain inaccuracies and incompleteness, which are well-known challenges in requirements engineering. In addition to existing approaches that try to automatically identify and correct these deficits, there are also new trends to involve users more in the elaboration and refinement process. In this paper, we present the relevant state of the art in the field of automated detection and compensation of multiple inaccuracies in natural language service descriptions and name open challenges needed to be tackled in NL-based software service composition. }}, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)}}, editor = {{Damaševičius, Robertas and Vasiljevienė, Giedrė}}, isbn = {{9783319999715}}, issn = {{1865-0929}}, keywords = {{Inaccuracy detection, Natural language software requirements}}, location = {{Vilnius, Lithuania}}, pages = {{559--570}}, publisher = {{Springer}}, title = {{{NLP in OTF Computing: Current Approaches and Open Challenges}}}, doi = {{10.1007/978-3-319-99972-2_46}}, volume = {{920}}, 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{4373, author = {{Szopinski, Daniel}}, booktitle = {{Bosch Business Model Innovation Summit 2018}}, location = {{Renningen, Germany}}, title = {{{Towards software-based tools for business model development: Using external stimuli for business model idea generation}}}, 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}}, }