--- _id: '4805' author: - first_name: Alpaslan full_name: Dalkiran, Alpaslan last_name: Dalkiran citation: ama: Dalkiran A. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn; 2018. apa: Dalkiran, A. (2018). Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen. Universität Paderborn. bibtex: '@book{Dalkiran_2018, title={Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}, publisher={Universität Paderborn}, author={Dalkiran, Alpaslan}, year={2018} }' chicago: Dalkiran, Alpaslan. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn, 2018. ieee: A. Dalkiran, Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen. Universität Paderborn, 2018. mla: Dalkiran, Alpaslan. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn, 2018. short: A. Dalkiran, Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen, Universität Paderborn, 2018. date_created: 2018-10-24T07:09:05Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4806' author: - first_name: Gerrit full_name: Gräper, Gerrit last_name: Gräper citation: ama: Gräper G. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn; 2018. apa: Gräper, G. (2018). The Suitability of Equilibrium Concepts to evaluate competitive behaviour. Universität Paderborn. bibtex: '@book{Gräper_2018, title={The Suitability of Equilibrium Concepts to evaluate competitive behaviour}, publisher={Universität Paderborn}, author={Gräper, Gerrit}, year={2018} }' chicago: Gräper, Gerrit. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn, 2018. ieee: G. Gräper, The Suitability of Equilibrium Concepts to evaluate competitive behaviour. Universität Paderborn, 2018. mla: Gräper, Gerrit. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn, 2018. short: G. Gräper, The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour, Universität Paderborn, 2018. date_created: 2018-10-24T07:13:33Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: The Suitability of Equilibrium Concepts to evaluate competitive behaviour type: mastersthesis user_id: '477' year: '2018' ... --- _id: '4807' author: - first_name: Hüssein full_name: Hammo, Hüssein last_name: Hammo citation: ama: Hammo H. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn; 2018. apa: Hammo, H. (2018). Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft. Universität Paderborn. bibtex: '@book{Hammo_2018, title={Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft}, publisher={Universität Paderborn}, author={Hammo, Hüssein}, year={2018} }' chicago: Hammo, Hüssein. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn, 2018. ieee: H. Hammo, Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft. Universität Paderborn, 2018. mla: Hammo, Hüssein. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn, 2018. short: H. Hammo, Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft, Universität Paderborn, 2018. date_created: 2018-10-24T07:17:10Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft type: mastersthesis user_id: '477' year: '2018' ... --- _id: '4821' author: - first_name: Jessica full_name: Brachmann, Jessica last_name: Brachmann citation: ama: Brachmann J. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn; 2018. apa: Brachmann, J. (2018). Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse. Universität Paderborn. bibtex: '@book{Brachmann_2018, title={Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Brachmann, Jessica}, year={2018} }' chicago: Brachmann, Jessica. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. ieee: J. Brachmann, Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse. Universität Paderborn, 2018. mla: Brachmann, Jessica. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. short: J. Brachmann, Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T08:27:02Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4822' author: - first_name: Niklas full_name: Förstenberg, Niklas last_name: Förstenberg citation: ama: Förstenberg N. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn; 2018. apa: Förstenberg, N. (2018). Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse. Universität Paderborn. bibtex: '@book{Förstenberg_2018, title={Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Förstenberg, Niklas}, year={2018} }' chicago: Förstenberg, Niklas. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. ieee: N. Förstenberg, Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse. Universität Paderborn, 2018. mla: Förstenberg, Niklas. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. short: N. Förstenberg, Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T08:34:27Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4827' author: - first_name: Zohaib Ahmad full_name: Khan, Zohaib Ahmad last_name: Khan citation: ama: Khan ZA. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn; 2018. apa: Khan, Z. A. (2018). How can choice sets be architectured to nudge People into certain decisions? Universität Paderborn. bibtex: '@book{Khan_2018, title={How can choice sets be architectured to nudge People into certain decisions?}, publisher={Universität Paderborn}, author={Khan, Zohaib Ahmad}, year={2018} }' chicago: Khan, Zohaib Ahmad. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn, 2018. ieee: Z. A. Khan, How can choice sets be architectured to nudge People into certain decisions? Universität Paderborn, 2018. mla: Khan, Zohaib Ahmad. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn, 2018. short: Z.A. Khan, How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?, Universität Paderborn, 2018. date_created: 2018-10-24T10:02:54Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: How can choice sets be architectured to nudge People into certain decisions? type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4828' author: - first_name: Thomas full_name: Kusch, Thomas last_name: Kusch citation: ama: Kusch T. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn; 2018. apa: Kusch, T. (2018). Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse. Universität Paderborn. bibtex: '@book{Kusch_2018, title={Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Kusch, Thomas}, year={2018} }' chicago: Kusch, Thomas. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn, 2018. ieee: T. Kusch, Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse. Universität Paderborn, 2018. mla: Kusch, Thomas. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn, 2018. short: T. Kusch, Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T10:05:50Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4982' article_number: '89' author: - first_name: Britta full_name: Hoyer, Britta id: '42447' last_name: Hoyer - first_name: Stephanie full_name: Rosenkranz, Stephanie last_name: Rosenkranz citation: ama: Hoyer B, Rosenkranz S. Determinants of Equilibrium Selection in Network Formation - An Experiment. Games. 2018;9(4). apa: Hoyer, B., & Rosenkranz, S. (2018). Determinants of Equilibrium Selection in Network Formation - An Experiment. Games, 9(4). bibtex: '@article{Hoyer_Rosenkranz_2018, title={ Determinants of Equilibrium Selection in Network Formation - An Experiment}, volume={9}, number={489}, journal={Games}, publisher={MDPI}, author={Hoyer, Britta and Rosenkranz, Stephanie}, year={2018} }' chicago: Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” Games 9, no. 4 (2018). ieee: B. Hoyer and S. Rosenkranz, “ Determinants of Equilibrium Selection in Network Formation - An Experiment,” Games, vol. 9, no. 4, 2018. mla: Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” Games, vol. 9, no. 4, 89, MDPI, 2018. short: B. Hoyer, S. Rosenkranz, Games 9 (2018). date_created: 2018-10-29T10:27:40Z date_updated: 2022-01-06T07:01:33Z ddc: - '000' department: - _id: '280' - _id: '475' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:15:21Z date_updated: 2018-11-02T15:15:21Z file_id: '5296' file_name: games-09-00089.pdf file_size: 492018 relation: main_file success: 1 file_date_updated: 2018-11-02T15:15:21Z has_accepted_license: '1' intvolume: ' 9' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://www.mdpi.com/2073-4336/9/4/89/ oa: '1' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Games publisher: MDPI status: public title: ' Determinants of Equilibrium Selection in Network Formation - An Experiment' type: journal_article user_id: '42447' volume: 9 year: '2018' ... --- _id: '7570' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662' apa: 'Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662' bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }' chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.' ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, 2018.' mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.' short: 'F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.' conference: end_date: 2018-07-18 location: Vienna name: 30th Symposium on Parallelism in Algorithms and Architectures start_date: 2018-07-16 date_created: 2019-02-06T14:16:19Z date_updated: 2022-01-06T07:03:40Z ddc: - '000' department: - _id: '63' doi: 10.1145/3210377.3210662 file: - access_level: closed content_type: application/pdf creator: jschaef date_created: 2019-02-06T14:18:35Z date_updated: 2019-02-06T14:18:35Z file_id: '7576' file_name: p359-meyer-auf-der-heide.pdf file_size: 1504739 relation: main_file file_date_updated: 2019-02-06T14:18:35Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18 publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press status: public title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents' type: conference user_id: '30291' year: '2018' ... --- _id: '4351' abstract: - lang: eng text: "\tWe 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.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore 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.\r\n\tAlthough 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.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2' apa: Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2 bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }' chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_2. ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31. mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2. short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.' date_created: 2018-09-04T14:15:39Z date_updated: 2022-01-06T07:00:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-030-03232-6_2 external_id: arxiv: - '1808.10300' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:24:17Z date_updated: 2018-10-31T13:24:17Z file_id: '5210' file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf file_size: 329823 relation: main_file success: 1 file_date_updated: 2018-10-31T13:24:17Z has_accepted_license: '1' intvolume: ' 11201' language: - iso: eng page: '16-31 ' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publication_identifier: unknown: - 978-3-030-03231-9 publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability type: conference user_id: '23538' volume: 11201 year: '2018' ... --- _id: '4375' abstract: - lang: eng text: "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.\\\\\r\nThe network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe 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.\r\nFurthermore, 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.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers." author: - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4' apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4 bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }' chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4. ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018. mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4. short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.' conference: end_date: 2018-08-21 location: Helsinki name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) start_date: 2018-08-20 date_created: 2018-09-11T05:26:59Z date_updated: 2022-01-06T07:01:00Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-19759-9_4 file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2018-11-27T10:03:33Z date_updated: 2018-11-27T10:03:33Z file_id: '5863' file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf file_size: 1122875 relation: main_file success: 1 file_date_updated: 2018-11-27T10:03:33Z has_accepted_license: '1' keyword: - Distributed Storage - Multi-Dimensional Range Queries - Peer-to-Peer - Hilbert Curve language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) status: public title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension type: conference user_id: '14955' year: '2018' ... --- _id: '5222' abstract: - lang: eng text: '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: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.' apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.' bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }' chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018. ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018, vol. 11201, pp. 50–64. mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64. short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.' conference: location: Tokyo, Japan name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)' date_created: 2018-10-31T15:44:30Z date_updated: 2022-01-06T07:01:47Z ddc: - '040' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2018-10-31T15:59:26Z date_updated: 2018-10-31T15:59:26Z file_id: '5224' file_name: sss18_camera.pdf file_size: 367812 relation: main_file success: 1 file_date_updated: 2018-10-31T15:59:26Z has_accepted_license: '1' intvolume: ' 11201' language: - iso: eng page: 50-64 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: On Underlay-Aware Self-Stabilizing Overlay Networks type: conference user_id: '477' volume: 11201 year: '2018' ... --- _id: '5330' abstract: - lang: eng text: "In Internet transactions, customers and service providers often interact once and anonymously.\r\nTo prevent deceptive behavior a reputation system is particularly important to\r\nreduce information asymmetries about the quality of the offered product or service. In this\r\nstudy we examine the effectiveness of a reputation system to reduce information asymmetries\r\nwhen customers may make mistakes in judging the provided service quality. In our model,\r\na service provider makes strategic quality choices and short-lived customers are asked to\r\nevaluate the observed quality by providing ratings to a reputation system. The customer is\r\nnot able to always evaluate the service quality correctly and possibly submits an erroneous\r\nrating according to a predefined probability. Considering reputation profiles of the last three\r\nsales, within the theoretical model we derive that the service provider’s dichotomous quality\r\ndecisions are independent of the reputation profile and depend only on the probabilities of\r\nreceiving positive and negative ratings when providing low or high quality. Thus, a service\r\nprovider optimally either maintains a good reputation or completely refrains from any reputation\r\nbuilding process. However, when mapping our theoretical model to an experimental\r\ndesign we find that a significant share of subjects in the role of the service provider deviates\r\nfrom optimal behavior and chooses actions which are conditional on the current reputation\r\nprofile. With respect to these individual quality choices we see that subjects use milking\r\nstrategies which means that they exploit a good reputation. In particular, if the sales price\r\nis high, low quality is delivered until the price drops below a certain threshold, and then\r\nhigh quality is chosen until the price increases again." article_number: e0207172 article_type: review author: - first_name: Behnud full_name: Mir Djawadi, Behnud id: '26032' last_name: Mir Djawadi orcid: 0000-0002-6271-5912 - first_name: Rene full_name: Fahr, Rene id: '111' last_name: Fahr - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake - first_name: Sonja full_name: Recker, Sonja last_name: Recker citation: ama: Mir Djawadi B, Fahr R, Haake C-J, Recker S. Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. PLoS ONE. 2018;13(11). doi:10.1371/journal.pone.0207172 apa: Mir Djawadi, B., Fahr, R., Haake, C.-J., & Recker, S. (2018). Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. PLoS ONE, 13(11). https://doi.org/10.1371/journal.pone.0207172 bibtex: '@article{Mir Djawadi_Fahr_Haake_Recker_2018, title={Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate}, volume={13}, DOI={10.1371/journal.pone.0207172}, number={11e0207172}, journal={PLoS ONE}, publisher={Public Library of Science}, author={Mir Djawadi, Behnud and Fahr, Rene and Haake, Claus-Jochen and Recker, Sonja}, year={2018} }' chicago: Mir Djawadi, Behnud, Rene Fahr, Claus-Jochen Haake, and Sonja Recker. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” PLoS ONE 13, no. 11 (2018). https://doi.org/10.1371/journal.pone.0207172. ieee: B. Mir Djawadi, R. Fahr, C.-J. Haake, and S. Recker, “Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate,” PLoS ONE, vol. 13, no. 11, 2018. mla: Mir Djawadi, Behnud, et al. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” PLoS ONE, vol. 13, no. 11, e0207172, Public Library of Science, 2018, doi:10.1371/journal.pone.0207172. short: B. Mir Djawadi, R. Fahr, C.-J. Haake, S. Recker, PLoS ONE 13 (2018). date_created: 2018-11-03T11:51:48Z date_updated: 2022-01-06T07:01:50Z ddc: - '330' department: - _id: '205' - _id: '475' doi: 10.1371/journal.pone.0207172 file: - access_level: closed content_type: application/pdf creator: cjhaake date_created: 2018-11-13T20:51:34Z date_updated: 2018-11-13T20:51:34Z file_id: '5542' file_name: Maintaining_vs_Milking.pdf file_size: 1107189 relation: main_file success: 1 file_date_updated: 2018-11-13T20:51:34Z funded_apc: '1' has_accepted_license: '1' intvolume: ' 13' issue: '11' language: - iso: eng project: - _id: '7' name: SFB 901 - Subproject A3 - _id: '8' name: SFB 901 - Subproject A4 - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A publication: PLoS ONE publication_identifier: eissn: - 1932-6203 publication_status: published publisher: Public Library of Science status: public title: Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate type: journal_article user_id: '477' volume: 13 year: '2018' ... --- _id: '5368' author: - first_name: Moritz full_name: Jochmaring, Moritz last_name: Jochmaring citation: ama: Jochmaring M. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn; 2018. apa: Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn. bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }' chicago: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018. ieee: M. Jochmaring, Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn, 2018. mla: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018. short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018. date_created: 2018-11-06T06:21:37Z date_updated: 2022-01-06T07:01:50Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5403' author: - first_name: Marcel full_name: Geromel, Marcel last_name: Geromel citation: ama: Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018. apa: Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn. bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }' chicago: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. ieee: M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018. mla: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018. date_created: 2018-11-07T09:20:59Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Mobile Facility Leasing type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5404' author: - first_name: Patrick Irenäus full_name: Kolpaczki, Patrick Irenäus last_name: Kolpaczki citation: ama: Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018. apa: Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn. bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }' chicago: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018. ieee: P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018. mla: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018. short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018. date_created: 2018-11-07T09:23:17Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Algorithmen für das k-Page Migration Problem type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5422' author: - first_name: Viktoria full_name: Diemke, Viktoria last_name: Diemke citation: ama: Diemke V. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen. Universität Paderborn; 2018. apa: Diemke, V. (2018). Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen. Universität Paderborn. bibtex: '@book{Diemke_2018, title={Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen}, publisher={Universität Paderborn}, author={Diemke, Viktoria}, year={2018} }' chicago: Diemke, Viktoria. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen. Universität Paderborn, 2018. ieee: V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen. Universität Paderborn, 2018. mla: Diemke, Viktoria. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen. Universität Paderborn, 2018. short: V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen, Universität Paderborn, 2018. date_created: 2018-11-07T16:36:06Z date_updated: 2022-01-06T07:01:53Z department: - _id: '19' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publisher: Universität Paderborn status: public title: Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '669' abstract: - lang: eng text: 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: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y apa: Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y bibtex: '@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }' chicago: 'Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.' ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018. mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y. short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167. date_created: 2017-10-26T14:11:04Z date_updated: 2022-01-06T07:03:15Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/s10878-017-0189-y external_id: arxiv: - '1607.05143' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:57:32Z date_updated: 2018-10-31T16:57:32Z file_id: '5226' file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf file_size: 605207 relation: main_file success: 1 file_date_updated: 2018-10-31T16:57:32Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1145-1167 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Journal of Combinatorial Optimization publication_identifier: issn: - 1382-6905 - 1573-2886 publication_status: published publisher: Springer Nature status: public title: Congestion games with mixed objectives type: journal_article user_id: '14052' volume: 36 year: '2018' ... --- _id: '1060' abstract: - lang: eng text: 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: - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Dirk full_name: van Straaten, Dirk id: '10311' last_name: van Straaten citation: ama: 'Neumann J, Gutt D, Kundisch D, van Straaten D. When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews. In: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany. ; 2018.' apa: Neumann, J., Gutt, D., Kundisch, D., & van Straaten, D. (2018). When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews. In Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany. bibtex: '@inproceedings{Neumann_Gutt_Kundisch_van Straaten_2018, title={When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews}, booktitle={Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis and van Straaten, Dirk}, year={2018} }' chicago: Neumann, Jürgen, Dominik Gutt, Dennis Kundisch, and Dirk van Straaten. “When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews.” In Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. ieee: J. Neumann, D. Gutt, D. Kundisch, and D. van Straaten, “When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews,” in Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. mla: Neumann, Jürgen, et al. “When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews.” Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. short: 'J. Neumann, D. Gutt, D. Kundisch, D. van Straaten, in: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018.' date_created: 2017-12-18T08:12:09Z date_updated: 2022-01-06T06:50:47Z ddc: - '330' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: d0mi date_created: 2018-11-12T10:30:04Z date_updated: 2018-11-12T10:30:04Z file_id: '5485' file_name: MKWI_110 (1).pdf file_size: 668515 relation: main_file success: 1 file_date_updated: 2018-11-12T10:30:04Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany status: public title: When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews type: conference user_id: '14368' year: '2018' ... --- _id: '1061' abstract: - lang: eng text: 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: - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt citation: ama: 'Gutt D. Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales. In: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany. ; 2018.' apa: Gutt, D. (2018). Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales. In Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany. bibtex: '@inproceedings{Gutt_2018, title={Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales}, booktitle={Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}, author={Gutt, Dominik}, year={2018} }' chicago: Gutt, Dominik. “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and Their Relationship with Sales.” In Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. ieee: D. Gutt, “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales,” in Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. mla: Gutt, Dominik. “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and Their Relationship with Sales.” Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018. short: 'D. Gutt, in: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018.' date_created: 2017-12-18T08:15:08Z date_updated: 2022-01-06T06:50:47Z ddc: - '330' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: d0mi date_created: 2018-11-12T10:34:18Z date_updated: 2018-11-12T10:34:18Z file_id: '5488' file_name: MKWI_189 (1).pdf file_size: 171061 relation: main_file success: 1 file_date_updated: 2018-11-12T10:34:18Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany status: public title: Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales type: conference user_id: '14368' year: '2018' ...