[{"date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","date_created":"2018-10-24T07:09:05Z","author":[{"first_name":"Alpaslan","full_name":"Dalkiran, Alpaslan","last_name":"Dalkiran"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"title":"Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen","year":"2018","citation":{"ieee":"A. Dalkiran, <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn, 2018.","chicago":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","ama":"Dalkiran A. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn; 2018.","short":"A. Dalkiran, Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen, Universität Paderborn, 2018.","bibtex":"@book{Dalkiran_2018, title={Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}, publisher={Universität Paderborn}, author={Dalkiran, Alpaslan}, year={2018} }","mla":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","apa":"Dalkiran, A. (2018). <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn."},"_id":"4805","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"_id":"4806","project":[{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","author":[{"full_name":"Gräper, Gerrit","last_name":"Gräper","first_name":"Gerrit"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_created":"2018-10-24T07:13:33Z","title":"The Suitability of Equilibrium Concepts to evaluate competitive behaviour","year":"2018","citation":{"chicago":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018.","ieee":"G. Gräper, <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn, 2018.","ama":"Gräper G. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn; 2018.","apa":"Gräper, G. (2018). <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn.","short":"G. Gräper, The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour, Universität Paderborn, 2018.","mla":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018.","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} }"}},{"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"_id":"4807","user_id":"477","department":[{"_id":"280"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","author":[{"first_name":"Hüssein","last_name":"Hammo","full_name":"Hammo, Hüssein"}],"supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-24T07:17:10Z","title":"Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft","year":"2018","citation":{"chicago":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018.","ieee":"H. Hammo, <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn, 2018.","ama":"Hammo H. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn; 2018.","mla":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018.","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} }","short":"H. Hammo, Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft, Universität Paderborn, 2018.","apa":"Hammo, H. (2018). <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn."}},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","author":[{"last_name":"Brachmann","full_name":"Brachmann, Jessica","first_name":"Jessica"}],"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-24T08:27:02Z","title":"Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse","year":"2018","citation":{"mla":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","bibtex":"@book{Brachmann_2018, title={Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Brachmann, Jessica}, year={2018} }","short":"J. Brachmann, Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018.","apa":"Brachmann, J. (2018). <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","ama":"Brachmann J. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018.","ieee":"J. Brachmann, <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","chicago":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018."},"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"_id":"4821","user_id":"477","department":[{"_id":"280"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"language":[{"iso":"eng"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"_id":"4822","user_id":"477","department":[{"_id":"280"}],"status":"public","type":"bachelorsthesis","title":"Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse","date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"author":[{"full_name":"Förstenberg, Niklas","last_name":"Förstenberg","first_name":"Niklas"}],"date_created":"2018-10-24T08:34:27Z","year":"2018","citation":{"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} }","mla":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. 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.","apa":"Förstenberg, N. (2018). <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","chicago":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ieee":"N. Förstenberg, <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ama":"Förstenberg N. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018."}},{"_id":"4827","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"full_name":"Khan, Zohaib Ahmad","last_name":"Khan","first_name":"Zohaib Ahmad"}],"date_created":"2018-10-24T10:02:54Z","title":"How can choice sets be architectured to nudge People into certain decisions?","year":"2018","citation":{"ieee":"Z. A. Khan, <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn, 2018.","chicago":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018.","ama":"Khan ZA. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn; 2018.","apa":"Khan, Z. A. (2018). <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn.","mla":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018.","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} }","short":"Z.A. Khan, How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?, Universität Paderborn, 2018."}},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"4828","language":[{"iso":"eng"}],"citation":{"apa":"Kusch, T. (2018). <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. 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} }","mla":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","short":"T. Kusch, Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse, Universität Paderborn, 2018.","chicago":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","ieee":"T. Kusch, <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. Universität Paderborn, 2018.","ama":"Kusch T. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn; 2018."},"year":"2018","author":[{"first_name":"Thomas","last_name":"Kusch","full_name":"Kusch, Thomas"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"date_created":"2018-10-24T10:05:50Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","title":"Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse"},{"main_file_link":[{"url":"http://www.mdpi.com/2073-4336/9/4/89/","open_access":"1"}],"date_updated":"2022-01-06T07:01:33Z","oa":"1","volume":9,"author":[{"full_name":"Hoyer, Britta","id":"42447","last_name":"Hoyer","first_name":"Britta"},{"full_name":"Rosenkranz, Stephanie","last_name":"Rosenkranz","first_name":"Stephanie"}],"intvolume":"         9","citation":{"apa":"Hoyer, B., &#38; Rosenkranz, S. (2018).  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>, <i>9</i>(4).","mla":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i>, vol. 9, no. 4, 89, MDPI, 2018.","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} }","short":"B. Hoyer, S. Rosenkranz, Games 9 (2018).","chicago":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i> 9, no. 4 (2018).","ieee":"B. Hoyer and S. Rosenkranz, “ Determinants of Equilibrium Selection in Network Formation - An Experiment,” <i>Games</i>, vol. 9, no. 4, 2018.","ama":"Hoyer B, Rosenkranz S.  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>. 2018;9(4)."},"has_accepted_license":"1","article_number":"89","file_date_updated":"2018-11-02T15:15:21Z","_id":"4982","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"42447","status":"public","type":"journal_article","title":" Determinants of Equilibrium Selection in Network Formation - An Experiment","publisher":"MDPI","date_created":"2018-10-29T10:27:40Z","year":"2018","issue":"4","ddc":["000"],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:15:21Z","date_created":"2018-11-02T15:15:21Z","creator":"ups","file_size":492018,"file_name":"games-09-00089.pdf","access_level":"closed","file_id":"5296"}],"publication":"Games"},{"department":[{"_id":"63"}],"user_id":"30291","_id":"7570","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2019-02-06T14:18:35Z","type":"conference","status":"public","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Johannes Sebastian","last_name":"Schaefer","id":"30291","full_name":"Schaefer, Johannes Sebastian"}],"date_updated":"2022-01-06T07:03:40Z","doi":"10.1145/3210377.3210662","conference":{"location":"Vienna","end_date":"2018-07-18","start_date":"2018-07-16","name":"30th Symposium on Parallelism in Algorithms and Architectures"},"publication_identifier":{"isbn":["9781450357999"]},"has_accepted_license":"1","publication_status":"published","citation":{"apa":"Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. Vienna: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>}, 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} }","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.","mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>.","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>."},"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18","file":[{"access_level":"closed","file_name":"p359-meyer-auf-der-heide.pdf","file_id":"7576","file_size":1504739,"creator":"jschaef","date_created":"2019-02-06T14:18:35Z","date_updated":"2019-02-06T14:18:35Z","relation":"main_file","content_type":"application/pdf"}],"date_created":"2019-02-06T14:16:19Z","publisher":"ACM Press","title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","year":"2018"},{"file_date_updated":"2018-10-31T13:24:17Z","series_title":"Lecture Notes in Computer Science","user_id":"23538","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4351","status":"public","type":"conference","doi":"10.1007/978-3-030-03232-6_2","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"volume":11201,"date_updated":"2022-01-06T07:00:58Z","citation":{"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.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>}, 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} }","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>.","apa":"Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201, pp. 16–31). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018, vol. 11201, pp. 16–31.","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>.","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>"},"page":"16-31 ","intvolume":"     11201","publication_identifier":{"unknown":["978-3-030-03231-9"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["040"],"external_id":{"arxiv":["1808.10300"]},"file":[{"access_level":"closed","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","file_id":"5210","file_size":329823,"creator":"mfeldma2","date_created":"2018-10-31T13:24:17Z","date_updated":"2018-10-31T13:24:17Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"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","lang":"eng"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","date_created":"2018-09-04T14:15:39Z","publisher":"Springer, Cham","year":"2018"},{"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: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","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 <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","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 <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","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.","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={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, 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} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>"},"year":"2018","has_accepted_license":"1","conference":{"start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","location":"Helsinki","end_date":"2018-08-21"},"doi":"10.1007/978-3-030-19759-9_4","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till","first_name":"Till"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"},{"id":"38705","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","first_name":"Jannik"}],"date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-27T10:03:33Z","creator":"tillk","date_created":"2018-11-27T10:03:33Z","file_size":1122875,"file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_id":"5863","access_level":"closed"}],"status":"public","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."}],"type":"conference","publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","file_date_updated":"2018-11-27T10:03:33Z","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"user_id":"14955","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4375"},{"has_accepted_license":"1","page":"50-64","intvolume":"     11201","citation":{"ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.","ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, vol. 11201, Springer, 2018, pp. 50–64.","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} }","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.","apa":"Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer."},"date_updated":"2022-01-06T07:01:47Z","volume":11201,"author":[{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"conference":{"location":"Tokyo, Japan","name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"type":"conference","status":"public","_id":"5222","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"477","file_date_updated":"2018-10-31T15:59:26Z","year":"2018","publisher":"Springer","date_created":"2018-10-31T15:44:30Z","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","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. "}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-10-31T15:59:26Z","creator":"thgoette","date_updated":"2018-10-31T15:59:26Z","access_level":"closed","file_name":"sss18_camera.pdf","file_id":"5224","file_size":367812}],"ddc":["040"],"language":[{"iso":"eng"}]},{"_id":"5330","project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"205"},{"_id":"475"}],"user_id":"477","article_number":"e0207172","article_type":"review","funded_apc":"1","file_date_updated":"2018-11-13T20:51:34Z","type":"journal_article","status":"public","date_updated":"2022-01-06T07:01:50Z","volume":13,"author":[{"first_name":"Behnud","orcid":"0000-0002-6271-5912","last_name":"Mir Djawadi","id":"26032","full_name":"Mir Djawadi, Behnud"},{"first_name":"Rene","last_name":"Fahr","id":"111","full_name":"Fahr, Rene"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Recker","full_name":"Recker, Sonja","first_name":"Sonja"}],"doi":"10.1371/journal.pone.0207172","publication_identifier":{"eissn":["1932-6203"]},"has_accepted_license":"1","publication_status":"published","intvolume":"        13","citation":{"short":"B. Mir Djawadi, R. Fahr, C.-J. Haake, S. Recker, PLoS ONE 13 (2018).","mla":"Mir Djawadi, Behnud, et al. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i>, vol. 13, no. 11, e0207172, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>.","bibtex":"@article{Mir Djawadi_Fahr_Haake_Recker_2018, title={Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate}, volume={13}, DOI={<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>}, 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} }","apa":"Mir Djawadi, B., Fahr, R., Haake, C.-J., &#38; Recker, S. (2018). Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>, <i>13</i>(11). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>","ama":"Mir Djawadi B, Fahr R, Haake C-J, Recker S. Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>. 2018;13(11). doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>","ieee":"B. Mir Djawadi, R. Fahr, C.-J. Haake, and S. Recker, “Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate,” <i>PLoS ONE</i>, vol. 13, no. 11, 2018.","chicago":"Mir Djawadi, Behnud, Rene Fahr, Claus-Jochen Haake, and Sonja Recker. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i> 13, no. 11 (2018). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>."},"ddc":["330"],"language":[{"iso":"eng"}],"publication":"PLoS ONE","abstract":[{"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.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-13T20:51:34Z","date_created":"2018-11-13T20:51:34Z","creator":"cjhaake","file_size":1107189,"file_id":"5542","access_level":"closed","file_name":"Maintaining_vs_Milking.pdf"}],"publisher":"Public Library of Science","date_created":"2018-11-03T11:51:48Z","title":"Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate","issue":"11","year":"2018"},{"_id":"5368","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"first_name":"Moritz","last_name":"Jochmaring","full_name":"Jochmaring, Moritz"}],"date_created":"2018-11-06T06:21:37Z","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","year":"2018","citation":{"ieee":"M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. 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.","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} }"}},{"year":"2018","citation":{"bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018."},"title":"Mobile Facility Leasing","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2018-11-07T09:20:59Z","author":[{"first_name":"Marcel","last_name":"Geromel","full_name":"Geromel, Marcel"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5403","user_id":"477","department":[{"_id":"63"}]},{"year":"2018","citation":{"ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn; 2018.","apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","mla":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","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} }"},"title":"Online Algorithmen für das k-Page Migration Problem","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2018-11-07T09:23:17Z","author":[{"first_name":"Patrick Irenäus","full_name":"Kolpaczki, Patrick Irenäus","last_name":"Kolpaczki"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5404","user_id":"477","department":[{"_id":"63"}]},{"author":[{"full_name":"Diemke, Viktoria","last_name":"Diemke","first_name":"Viktoria"}],"date_created":"2018-11-07T16:36:06Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:53Z","title":"Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen","citation":{"bibtex":"@book{Diemke_2018, title={Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen}, publisher={Universität Paderborn}, author={Diemke, Viktoria}, year={2018} }","short":"V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen, Universität Paderborn, 2018.","mla":"Diemke, Viktoria. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018.","apa":"Diemke, V. (2018). <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn.","ama":"Diemke V. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn; 2018.","chicago":"Diemke, Viktoria. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018.","ieee":"V. Diemke, <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018."},"year":"2018","department":[{"_id":"19"}],"user_id":"477","_id":"5422","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"issue":"4","year":"2018","date_created":"2017-10-26T14:11:04Z","publisher":"Springer Nature","title":"Congestion games with mixed objectives","publication":"Journal of Combinatorial Optimization","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":605207,"access_level":"closed","file_id":"5226","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","date_updated":"2018-10-31T16:57:32Z","date_created":"2018-10-31T16:57:32Z","creator":"feldi"}],"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."}],"external_id":{"arxiv":["1607.05143"]},"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","publication_identifier":{"issn":["1382-6905","1573-2886"]},"has_accepted_license":"1","citation":{"apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>"},"page":"1145-1167","intvolume":"        36","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"volume":36,"date_updated":"2022-01-06T07:03:15Z","doi":"10.1007/s10878-017-0189-y","type":"journal_article","status":"public","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"669","file_date_updated":"2018-10-31T16:57:32Z"},{"title":"When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews","author":[{"first_name":"Jürgen","last_name":"Neumann","full_name":"Neumann, Jürgen","id":"32456"},{"last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368","first_name":"Dominik"},{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"first_name":"Dirk","last_name":"van Straaten","id":"10311","full_name":"van Straaten, Dirk"}],"date_created":"2017-12-18T08:12:09Z","date_updated":"2022-01-06T06:50:47Z","citation":{"short":"J. Neumann, D. Gutt, D. Kundisch, D. van Straaten, in: Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany, 2018.","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} }","mla":"Neumann, Jürgen, et al. “When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews.” <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 2018.","apa":"Neumann, J., Gutt, D., Kundisch, D., &#38; van Straaten, D. (2018). When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews. In <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>.","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 <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 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 <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 2018.","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: <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>. ; 2018."},"year":"2018","has_accepted_license":"1","file_date_updated":"2018-11-12T10:30:04Z","language":[{"iso":"eng"}],"ddc":["330"],"user_id":"14368","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"1060","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-12T10:30:04Z","creator":"d0mi","date_updated":"2018-11-12T10:30:04Z","access_level":"closed","file_name":"MKWI_110 (1).pdf","file_id":"5485","file_size":668515}],"status":"public","abstract":[{"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.","lang":"eng"}],"type":"conference","publication":"Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany"},{"year":"2018","citation":{"mla":"Gutt, Dominik. “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and Their Relationship with Sales.” <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 2018.","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} }","short":"D. Gutt, 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 <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>.","chicago":"Gutt, Dominik. “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and Their Relationship with Sales.” In <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 2018.","ieee":"D. Gutt, “Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales,” in <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>, 2018.","ama":"Gutt D. Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales. In: <i>Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany</i>. ; 2018."},"has_accepted_license":"1","title":"Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales","date_updated":"2022-01-06T06:50:47Z","date_created":"2017-12-18T08:15:08Z","author":[{"first_name":"Dominik","last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368"}],"abstract":[{"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.","lang":"eng"}],"file":[{"access_level":"closed","file_id":"5488","file_name":"MKWI_189 (1).pdf","file_size":171061,"creator":"d0mi","date_created":"2018-11-12T10:34:18Z","date_updated":"2018-11-12T10:34:18Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany","ddc":["330"],"file_date_updated":"2018-11-12T10:34:18Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"1061","user_id":"14368","department":[{"_id":"276"}]}]